/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/loop-acceleration/array_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:45:43,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:45:43,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:45:43,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:45:43,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:45:43,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:45:43,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:45:43,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:45:43,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:45:43,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:45:43,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:45:43,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:45:43,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:45:43,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:45:43,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:45:43,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:45:43,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:45:43,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:45:43,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:45:43,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:45:43,820 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:45:43,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:45:43,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:45:43,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:45:43,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:45:43,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:45:43,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:45:43,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:45:43,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:45:43,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:45:43,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:45:43,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:45:43,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:45:43,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:45:43,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:45:43,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:45:43,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:45:43,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:45:43,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:45:43,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:45:43,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:45:43,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:45:43,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:45:43,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:45:43,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:45:43,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:45:43,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:45:43,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:45:43,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:45:43,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:45:43,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:45:43,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:45:43,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:45:43,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:45:43,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:45:43,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:45:43,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:45:43,847 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:45:43,847 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:45:43,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:45:43,847 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:45:43,847 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:45:44,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:45:44,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:45:44,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:45:44,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:45:44,096 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:45:44,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-1.c [2022-04-15 05:45:44,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f125c5e/d9b0786bab6a4cb39111896286949230/FLAG6eb8abe82 [2022-04-15 05:45:44,523 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:45:44,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c [2022-04-15 05:45:44,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f125c5e/d9b0786bab6a4cb39111896286949230/FLAG6eb8abe82 [2022-04-15 05:45:44,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f125c5e/d9b0786bab6a4cb39111896286949230 [2022-04-15 05:45:44,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:45:44,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:45:44,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:45:44,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:45:44,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:45:44,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:45:44" (1/1) ... [2022-04-15 05:45:44,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cff158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:44, skipping insertion in model container [2022-04-15 05:45:44,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:45:44" (1/1) ... [2022-04-15 05:45:44,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:45:44,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:45:45,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c[321,334] [2022-04-15 05:45:45,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:45:45,124 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:45:45,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c[321,334] [2022-04-15 05:45:45,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:45:45,155 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:45:45,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45 WrapperNode [2022-04-15 05:45:45,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:45:45,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:45:45,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:45:45,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:45:45,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:45:45,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:45:45,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:45:45,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:45:45,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (1/1) ... [2022-04-15 05:45:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:45:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:45,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:45:45,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:45:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:45:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:45:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:45:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:45:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:45:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:45:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:45:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:45:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:45:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:45:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:45:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:45:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:45:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:45:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:45:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:45:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:45:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:45:45,347 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:45:45,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:45:45,478 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:45:45,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:45:45,483 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:45:45,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:45:45 BoogieIcfgContainer [2022-04-15 05:45:45,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:45:45,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:45:45,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:45:45,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:45:45,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:45:44" (1/3) ... [2022-04-15 05:45:45,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd0844f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:45:45, skipping insertion in model container [2022-04-15 05:45:45,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:45" (2/3) ... [2022-04-15 05:45:45,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd0844f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:45:45, skipping insertion in model container [2022-04-15 05:45:45,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:45:45" (3/3) ... [2022-04-15 05:45:45,510 INFO L111 eAbstractionObserver]: Analyzing ICFG array_1-1.c [2022-04-15 05:45:45,514 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:45:45,514 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:45:45,559 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:45:45,570 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:45:45,570 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:45:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:45:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:45:45,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:45,607 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:45,607 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 1 times [2022-04-15 05:45:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704112616] [2022-04-15 05:45:45,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:45:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 2 times [2022-04-15 05:45:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:45,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110451969] [2022-04-15 05:45:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:45,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 05:45:45,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 05:45:45,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-15 05:45:45,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:45,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 05:45:45,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 05:45:45,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-15 05:45:45,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-15 05:45:45,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29#(= main_~i~0 0)} is VALID [2022-04-15 05:45:45,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < 1024); {25#false} is VALID [2022-04-15 05:45:45,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25#false} is VALID [2022-04-15 05:45:45,888 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25#false} is VALID [2022-04-15 05:45:45,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 05:45:45,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 05:45:45,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 05:45:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110451969] [2022-04-15 05:45:45,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110451969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:45,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:45,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:45:45,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:45,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704112616] [2022-04-15 05:45:45,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704112616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:45,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:45,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:45:45,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015794838] [2022-04-15 05:45:45,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:45:45,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:45,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:45,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:45,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:45:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:45,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:45:45,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:45:45,944 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:46,044 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 05:45:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:45:46,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:45:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-15 05:45:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-15 05:45:46,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-15 05:45:46,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:46,118 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:45:46,118 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 05:45:46,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:45:46,126 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:46,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 05:45:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-15 05:45:46,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:46,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,153 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,153 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:46,155 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:45:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:45:46,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:46,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:46,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 05:45:46,156 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 05:45:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:46,158 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:45:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:45:46,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:46,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:46,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:46,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 05:45:46,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-15 05:45:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:46,162 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 05:45:46,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 05:45:46,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 05:45:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:45:46,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:46,187 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:46,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:45:46,188 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:46,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 1 times [2022-04-15 05:45:46,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:46,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132596789] [2022-04-15 05:45:46,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:46,219 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:46,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 2 times [2022-04-15 05:45:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:46,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102953221] [2022-04-15 05:45:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:46,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-15 05:45:46,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-15 05:45:46,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-15 05:45:46,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:46,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-15 05:45:46,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-15 05:45:46,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-15 05:45:46,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-15 05:45:46,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {174#(= main_~i~0 0)} is VALID [2022-04-15 05:45:46,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {174#(= main_~i~0 0)} is VALID [2022-04-15 05:45:46,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {175#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:46,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-15 05:45:46,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-15 05:45:46,302 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-15 05:45:46,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-15 05:45:46,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-15 05:45:46,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-15 05:45:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:46,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:46,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102953221] [2022-04-15 05:45:46,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102953221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:46,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845939417] [2022-04-15 05:45:46,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:45:46,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:46,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:46,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:45:46,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:45:46,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:46,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:45:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:46,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:46,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-15 05:45:46,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-15 05:45:46,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-15 05:45:46,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-15 05:45:46,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-15 05:45:46,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {195#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:46,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {195#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:46,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {175#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:46,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-15 05:45:46,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-15 05:45:46,518 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-15 05:45:46,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-15 05:45:46,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-15 05:45:46,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-15 05:45:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:46,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:46,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-15 05:45:46,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-15 05:45:46,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-15 05:45:46,616 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-15 05:45:46,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-15 05:45:46,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(< main_~i~0 1024)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-15 05:45:46,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {235#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:46,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {239#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:46,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {239#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:46,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-15 05:45:46,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-15 05:45:46,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-15 05:45:46,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-15 05:45:46,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-15 05:45:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:46,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845939417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:46,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:46,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:45:46,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:46,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132596789] [2022-04-15 05:45:46,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132596789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:46,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:46,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:45:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840841233] [2022-04-15 05:45:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:45:46,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:46,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:46,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:45:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:45:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:45:46,642 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:46,715 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:45:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:45:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:45:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 05:45:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 05:45:46,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 05:45:46,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:46,745 INFO L225 Difference]: With dead ends: 24 [2022-04-15 05:45:46,745 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 05:45:46,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:45:46,749 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:46,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 05:45:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 05:45:46,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:46,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,762 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,763 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:46,771 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:45:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:45:46,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:46,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:46,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 05:45:46,776 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 05:45:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:46,778 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:45:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:45:46,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:46,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:46,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:46,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 05:45:46,779 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-15 05:45:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:46,780 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 05:45:46,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:46,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 05:45:46,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 05:45:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:45:46,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:46,800 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:46,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:47,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:47,021 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 3 times [2022-04-15 05:45:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:47,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [696515873] [2022-04-15 05:45:47,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:47,025 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:47,025 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 4 times [2022-04-15 05:45:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:47,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860313325] [2022-04-15 05:45:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:47,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 05:45:47,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 05:45:47,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-15 05:45:47,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:47,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 05:45:47,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 05:45:47,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-15 05:45:47,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-15 05:45:47,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {390#(= main_~i~0 0)} is VALID [2022-04-15 05:45:47,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {390#(= main_~i~0 0)} is VALID [2022-04-15 05:45:47,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {391#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:47,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {391#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:47,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {392#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:47,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-15 05:45:47,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-15 05:45:47,158 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-15 05:45:47,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 05:45:47,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 05:45:47,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 05:45:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:47,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860313325] [2022-04-15 05:45:47,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860313325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:47,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678340261] [2022-04-15 05:45:47,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:45:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:47,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:47,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:45:47,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:45:47,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:47,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:45:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:47,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:47,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 05:45:47,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 05:45:47,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 05:45:47,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-15 05:45:47,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-15 05:45:47,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {412#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:47,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {412#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:47,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {391#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:47,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {391#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:47,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {392#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:47,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-15 05:45:47,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-15 05:45:47,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-15 05:45:47,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 05:45:47,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 05:45:47,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 05:45:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:47,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:47,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 05:45:47,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 05:45:47,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 05:45:47,390 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-15 05:45:47,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-15 05:45:47,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(< main_~i~0 1024)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-15 05:45:47,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {458#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:47,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {462#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:47,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {462#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:47,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {469#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:47,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {469#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:47,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-15 05:45:47,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-15 05:45:47,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 05:45:47,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 05:45:47,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 05:45:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:47,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678340261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:47,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:47,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:45:47,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:47,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [696515873] [2022-04-15 05:45:47,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [696515873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:47,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:47,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:45:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901085518] [2022-04-15 05:45:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:47,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:45:47,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:47,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:47,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:45:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:47,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:45:47,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:45:47,411 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:47,506 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:45:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:45:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:45:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 05:45:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 05:45:47,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-15 05:45:47,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:47,533 INFO L225 Difference]: With dead ends: 26 [2022-04-15 05:45:47,533 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 05:45:47,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:45:47,540 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:47,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 05:45:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 05:45:47,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:47,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,551 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,551 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:47,552 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:45:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:45:47,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:47,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:47,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 05:45:47,553 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 05:45:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:47,559 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:45:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:45:47,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:47,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:47,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:47,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 05:45:47,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-15 05:45:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:47,562 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 05:45:47,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:47,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 05:45:47,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 05:45:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:45:47,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:47,581 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:47,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:47,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 05:45:47,792 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 5 times [2022-04-15 05:45:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:47,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604858606] [2022-04-15 05:45:47,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:47,800 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:47,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 6 times [2022-04-15 05:45:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:47,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244755258] [2022-04-15 05:45:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:47,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-15 05:45:47,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-15 05:45:47,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-15 05:45:47,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:47,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-15 05:45:47,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-15 05:45:47,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-15 05:45:47,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-15 05:45:47,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {634#(= main_~i~0 0)} is VALID [2022-04-15 05:45:47,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {634#(= main_~i~0 0)} is VALID [2022-04-15 05:45:47,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {635#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:47,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:47,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {636#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:47,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {636#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:47,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:47,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-15 05:45:47,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-15 05:45:47,923 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-15 05:45:47,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-15 05:45:47,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-15 05:45:47,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-15 05:45:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:47,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244755258] [2022-04-15 05:45:47,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244755258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:47,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006798826] [2022-04-15 05:45:47,925 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:45:47,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:47,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:47,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:47,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 05:45:47,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:45:47,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:47,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:45:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:48,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-15 05:45:48,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#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(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-15 05:45:48,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-15 05:45:48,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-15 05:45:48,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-15 05:45:48,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {657#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:48,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {657#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {657#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:48,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {635#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:48,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:48,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {636#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:48,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {636#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:48,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:48,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-15 05:45:48,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-15 05:45:48,065 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-15 05:45:48,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-15 05:45:48,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-15 05:45:48,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-15 05:45:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:48,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:48,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-15 05:45:48,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-15 05:45:48,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-15 05:45:48,179 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-15 05:45:48,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-15 05:45:48,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-15 05:45:48,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {709#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:48,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {713#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:48,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:48,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {720#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:48,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {720#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:48,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {727#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:48,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {727#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:48,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-15 05:45:48,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-15 05:45:48,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-15 05:45:48,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#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(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-15 05:45:48,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-15 05:45:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:48,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006798826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:48,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:48,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:45:48,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:48,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604858606] [2022-04-15 05:45:48,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604858606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:48,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:48,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:45:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128496932] [2022-04-15 05:45:48,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:45:48,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:48,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:48,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:45:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:45:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:45:48,201 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:48,306 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:45:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:45:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:45:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-15 05:45:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-15 05:45:48,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-15 05:45:48,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:48,339 INFO L225 Difference]: With dead ends: 28 [2022-04-15 05:45:48,339 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:45:48,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:45:48,341 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:48,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:45:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 05:45:48,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:48,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,352 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,352 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:48,357 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:45:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:45:48,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:48,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:48,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:45:48,358 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:45:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:48,361 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:45:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:45:48,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:48,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:48,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:48,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 05:45:48,366 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-15 05:45:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:48,366 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 05:45:48,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:48,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 05:45:48,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 05:45:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:45:48,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:48,386 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:48,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:48,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:48,600 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 7 times [2022-04-15 05:45:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:48,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391281776] [2022-04-15 05:45:48,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:48,603 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:48,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 8 times [2022-04-15 05:45:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:48,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995880462] [2022-04-15 05:45:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:48,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-15 05:45:48,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-15 05:45:48,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-15 05:45:48,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:48,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-15 05:45:48,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-15 05:45:48,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-15 05:45:48,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-15 05:45:48,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {906#(= main_~i~0 0)} is VALID [2022-04-15 05:45:48,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {906#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {906#(= main_~i~0 0)} is VALID [2022-04-15 05:45:48,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {907#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:48,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {907#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:48,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {908#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:48,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {908#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:48,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:48,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {909#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:48,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {910#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:48,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-15 05:45:48,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-15 05:45:48,713 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-15 05:45:48,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-15 05:45:48,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-15 05:45:48,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-15 05:45:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:48,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995880462] [2022-04-15 05:45:48,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995880462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:48,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379405494] [2022-04-15 05:45:48,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:45:48,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:48,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:48,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:48,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 05:45:48,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:45:48,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:48,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:45:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:48,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:48,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-15 05:45:48,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#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(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-15 05:45:48,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-15 05:45:48,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-15 05:45:48,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-15 05:45:48,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {930#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:48,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {930#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:48,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {907#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:48,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {907#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:48,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {908#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:48,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {908#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:48,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:48,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {909#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:48,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {910#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:48,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-15 05:45:48,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-15 05:45:48,880 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-15 05:45:48,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-15 05:45:48,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-15 05:45:48,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-15 05:45:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:48,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:49,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-15 05:45:49,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-15 05:45:49,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-15 05:45:49,022 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-15 05:45:49,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-15 05:45:49,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#(< main_~i~0 1024)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-15 05:45:49,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {988#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:49,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {992#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:49,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {999#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {992#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:49,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {999#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:49,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {999#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:49,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1006#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:49,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1013#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1006#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:49,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1013#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:49,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1013#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:49,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-15 05:45:49,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-15 05:45:49,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-15 05:45:49,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#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(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-15 05:45:49,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-15 05:45:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:49,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379405494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:49,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:49,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:45:49,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:49,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391281776] [2022-04-15 05:45:49,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391281776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:49,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:49,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:45:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194923889] [2022-04-15 05:45:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:49,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:45:49,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:49,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:49,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:45:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:45:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:45:49,044 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:49,181 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:45:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:45:49,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:45:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-15 05:45:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-15 05:45:49,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-15 05:45:49,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:49,212 INFO L225 Difference]: With dead ends: 30 [2022-04-15 05:45:49,212 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:45:49,212 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-15 05:45:49,213 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:49,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:45:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 05:45:49,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:49,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,228 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,228 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:49,229 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:45:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:45:49,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:49,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:49,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 05:45:49,230 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 05:45:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:49,231 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:45:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:45:49,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:49,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:49,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:49,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 05:45:49,232 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-15 05:45:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:49,233 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 05:45:49,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 05:45:49,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 05:45:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:45:49,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:49,260 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:49,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:49,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:49,474 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:49,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 9 times [2022-04-15 05:45:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:49,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024188402] [2022-04-15 05:45:49,477 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:49,477 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:49,477 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 10 times [2022-04-15 05:45:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:49,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037190932] [2022-04-15 05:45:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:49,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-15 05:45:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-15 05:45:49,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-15 05:45:49,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:49,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-15 05:45:49,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-15 05:45:49,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-15 05:45:49,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-15 05:45:49,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1206#(= main_~i~0 0)} is VALID [2022-04-15 05:45:49,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {1206#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1206#(= main_~i~0 0)} is VALID [2022-04-15 05:45:49,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {1206#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1207#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:49,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:49,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1208#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:49,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1208#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:49,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1209#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:49,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1209#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:49,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1210#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:49,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1210#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:49,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {1210#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1211#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:49,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-15 05:45:49,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-15 05:45:49,569 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-15 05:45:49,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-15 05:45:49,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-15 05:45:49,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-15 05:45:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037190932] [2022-04-15 05:45:49,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037190932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63367463] [2022-04-15 05:45:49,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:45:49,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:49,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:49,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:49,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:45:49,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:45:49,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:49,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:45:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:49,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:49,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-15 05:45:49,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#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(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-15 05:45:49,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-15 05:45:49,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-15 05:45:49,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-15 05:45:49,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1231#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:49,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1231#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:49,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1207#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:49,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:49,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1208#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:49,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1208#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:49,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1209#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:49,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1209#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:49,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1210#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:49,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1210#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:49,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {1210#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1211#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:49,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-15 05:45:49,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-15 05:45:49,749 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-15 05:45:49,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-15 05:45:49,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-15 05:45:49,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-15 05:45:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:49,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:49,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-15 05:45:49,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-15 05:45:49,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-15 05:45:49,915 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-15 05:45:49,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-15 05:45:49,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-15 05:45:49,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {1299#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1295#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:49,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {1299#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1299#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:49,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1299#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:49,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {1306#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1306#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:49,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1306#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:49,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1313#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:49,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1313#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:49,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1320#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:49,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1320#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:49,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1327#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:49,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1327#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:49,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-15 05:45:49,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-15 05:45:49,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-15 05:45:49,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#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(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-15 05:45:49,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-15 05:45:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63367463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:49,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:49,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 05:45:49,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024188402] [2022-04-15 05:45:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024188402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:49,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:49,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:45:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964419079] [2022-04-15 05:45:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:45:49,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:49,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:49,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:49,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:45:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:49,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:45:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:45:49,940 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:50,073 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 05:45:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:45:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:45:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 05:45:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 05:45:50,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-15 05:45:50,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:50,104 INFO L225 Difference]: With dead ends: 32 [2022-04-15 05:45:50,104 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:45:50,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=264, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:45:50,105 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:50,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:45:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 05:45:50,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:50,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,120 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,120 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:50,121 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:45:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 05:45:50,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:50,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:50,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 05:45:50,122 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 05:45:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:50,123 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:45:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 05:45:50,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:50,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:50,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:50,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 05:45:50,124 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-15 05:45:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:50,124 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 05:45:50,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 05:45:50,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 05:45:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:45:50,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:50,147 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:50,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:50,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:50,368 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 11 times [2022-04-15 05:45:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:50,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929743750] [2022-04-15 05:45:50,371 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:50,371 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:50,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 12 times [2022-04-15 05:45:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:50,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367324847] [2022-04-15 05:45:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:50,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-15 05:45:50,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-15 05:45:50,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-15 05:45:50,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:50,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-15 05:45:50,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-15 05:45:50,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-15 05:45:50,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-15 05:45:50,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1534#(= main_~i~0 0)} is VALID [2022-04-15 05:45:50,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {1534#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1534#(= main_~i~0 0)} is VALID [2022-04-15 05:45:50,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1535#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:50,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1535#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:50,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1536#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:50,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1536#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:50,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1537#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:50,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1537#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:50,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1538#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:50,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {1538#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1538#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:50,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {1538#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1539#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:50,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1539#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:50,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:50,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {1540#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-15 05:45:50,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-15 05:45:50,464 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-15 05:45:50,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-15 05:45:50,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-15 05:45:50,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-15 05:45:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:50,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367324847] [2022-04-15 05:45:50,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367324847] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:50,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485475009] [2022-04-15 05:45:50,465 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:45:50,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:50,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:50,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:45:50,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 05:45:50,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:50,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:45:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:50,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:50,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-15 05:45:50,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#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(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-15 05:45:50,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-15 05:45:50,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-15 05:45:50,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-15 05:45:50,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1560#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:50,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1560#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:50,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1535#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:50,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1535#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:50,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1536#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:50,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1536#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:50,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1537#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:50,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1537#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:50,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1538#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:50,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1538#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1538#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:50,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1538#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1539#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:50,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1539#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:50,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:50,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {1540#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-15 05:45:50,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-15 05:45:50,702 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-15 05:45:50,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-15 05:45:50,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-15 05:45:50,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-15 05:45:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:50,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:50,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-15 05:45:50,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-15 05:45:50,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-15 05:45:50,910 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-15 05:45:50,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-15 05:45:50,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-15 05:45:50,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {1634#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1630#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:50,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1634#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:50,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {1641#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1634#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:50,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {1641#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1641#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:50,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {1648#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1641#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:50,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {1648#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1648#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:50,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {1655#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1648#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:50,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {1655#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1655#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:50,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1655#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:50,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1662#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:50,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1662#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:50,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1669#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:50,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1669#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:50,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-15 05:45:50,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-15 05:45:50,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-15 05:45:50,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#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(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-15 05:45:50,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-15 05:45:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:50,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485475009] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:50,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:50,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 05:45:50,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:50,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929743750] [2022-04-15 05:45:50,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929743750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:50,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:50,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:45:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887757278] [2022-04-15 05:45:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:50,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:45:50,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:50,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:50,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:50,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:45:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:45:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:45:50,939 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:51,111 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:45:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:45:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:45:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-15 05:45:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-15 05:45:51,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-04-15 05:45:51,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:51,139 INFO L225 Difference]: With dead ends: 34 [2022-04-15 05:45:51,139 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 05:45:51,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-15 05:45:51,141 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:51,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 05:45:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 05:45:51,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:51,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,158 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,158 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:51,159 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:45:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 05:45:51,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:51,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:51,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 05:45:51,159 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 05:45:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:51,160 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:45:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 05:45:51,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:51,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:51,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:51,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 05:45:51,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-04-15 05:45:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:51,161 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 05:45:51,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 05:45:51,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 05:45:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:45:51,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:51,188 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:51,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:51,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:51,389 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1976406024, now seen corresponding path program 13 times [2022-04-15 05:45:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:51,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227157998] [2022-04-15 05:45:51,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:51,391 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:51,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1976406024, now seen corresponding path program 14 times [2022-04-15 05:45:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:51,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253405765] [2022-04-15 05:45:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:51,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {1898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 05:45:51,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 05:45:51,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-15 05:45:51,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:51,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 05:45:51,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 05:45:51,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-15 05:45:51,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret6 := main(); {1885#true} is VALID [2022-04-15 05:45:51,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1890#(= main_~i~0 0)} is VALID [2022-04-15 05:45:51,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1890#(= main_~i~0 0)} is VALID [2022-04-15 05:45:51,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1891#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:51,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1891#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:51,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {1891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1892#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:51,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1892#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:51,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1893#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:51,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1893#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:51,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1894#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:51,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1894#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:51,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1895#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:51,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {1895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1895#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:51,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {1895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1896#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:51,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1896#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:51,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1897#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:51,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#(<= main_~i~0 7)} assume !(~i~0 < 1024); {1886#false} is VALID [2022-04-15 05:45:51,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1886#false} is VALID [2022-04-15 05:45:51,490 INFO L272 TraceCheckUtils]: 22: Hoare triple {1886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1886#false} is VALID [2022-04-15 05:45:51,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 05:45:51,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 05:45:51,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 05:45:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:51,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253405765] [2022-04-15 05:45:51,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253405765] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:51,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472486156] [2022-04-15 05:45:51,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:45:51,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:51,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:51,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:45:51,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:45:51,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:51,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:45:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:51,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:51,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-15 05:45:51,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#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(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 05:45:51,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 05:45:51,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-15 05:45:51,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret6 := main(); {1885#true} is VALID [2022-04-15 05:45:51,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1917#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:51,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {1917#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1917#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:51,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1917#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1891#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:51,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {1891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1891#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:51,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1892#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:51,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1892#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:51,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1893#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:51,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {1893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1893#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:51,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1894#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:51,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1894#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:51,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1895#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:51,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {1895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1895#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:51,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {1895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1896#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:51,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1896#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:51,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1897#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:51,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#(<= main_~i~0 7)} assume !(~i~0 < 1024); {1886#false} is VALID [2022-04-15 05:45:51,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1886#false} is VALID [2022-04-15 05:45:51,713 INFO L272 TraceCheckUtils]: 22: Hoare triple {1886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1886#false} is VALID [2022-04-15 05:45:51,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 05:45:51,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 05:45:51,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 05:45:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:51,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:51,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 05:45:51,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 05:45:51,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 05:45:51,963 INFO L272 TraceCheckUtils]: 22: Hoare triple {1886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {1886#false} is VALID [2022-04-15 05:45:51,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1886#false} is VALID [2022-04-15 05:45:51,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1886#false} is VALID [2022-04-15 05:45:51,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {1997#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1993#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:51,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {1997#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1997#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:51,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {2004#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1997#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:51,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {2004#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2004#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:51,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {2011#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2004#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:51,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {2011#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2011#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:51,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {2018#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2011#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:51,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {2018#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2018#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:51,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {2025#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2018#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:51,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {2025#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2025#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:51,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {2032#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2025#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:51,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {2032#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2032#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:51,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {2039#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2032#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:51,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {2039#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2039#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:51,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2039#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:51,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret6 := main(); {1885#true} is VALID [2022-04-15 05:45:51,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #39#return; {1885#true} is VALID [2022-04-15 05:45:51,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2022-04-15 05:45:51,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#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(12, 2);call #Ultimate.allocInit(12, 3); {1885#true} is VALID [2022-04-15 05:45:51,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-15 05:45:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:51,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472486156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:51,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:51,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:45:51,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227157998] [2022-04-15 05:45:51,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227157998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:51,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:51,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:45:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176487451] [2022-04-15 05:45:51,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:45:51,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:51,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:51,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:51,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:45:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:45:52,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:45:52,000 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:52,193 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:45:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:45:52,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:45:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 05:45:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 05:45:52,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-15 05:45:52,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:52,229 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:45:52,229 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 05:45:52,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:45:52,230 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:52,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 05:45:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 05:45:52,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:52,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,253 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,254 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:52,256 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:45:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 05:45:52,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:52,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:52,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 05:45:52,256 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 05:45:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:52,257 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:45:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 05:45:52,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:52,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:52,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:52,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 05:45:52,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-04-15 05:45:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:52,259 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 05:45:52,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:52,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 05:45:52,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 05:45:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:45:52,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:52,290 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:52,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:52,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:52,491 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash 76556682, now seen corresponding path program 15 times [2022-04-15 05:45:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:52,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914232497] [2022-04-15 05:45:52,493 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:52,493 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:52,493 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 76556682, now seen corresponding path program 16 times [2022-04-15 05:45:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:52,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964958990] [2022-04-15 05:45:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:52,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {2283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-15 05:45:52,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-15 05:45:52,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-15 05:45:52,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:52,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-15 05:45:52,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-15 05:45:52,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-15 05:45:52,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret6 := main(); {2269#true} is VALID [2022-04-15 05:45:52,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2274#(= main_~i~0 0)} is VALID [2022-04-15 05:45:52,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {2274#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2274#(= main_~i~0 0)} is VALID [2022-04-15 05:45:52,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {2274#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2275#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:52,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {2275#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2275#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:52,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {2275#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:52,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {2276#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2276#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:52,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:52,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {2277#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2277#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:52,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {2277#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:52,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2278#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:52,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:52,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {2279#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2279#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:52,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {2279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:52,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {2280#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2280#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:52,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {2280#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2281#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:52,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {2281#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2281#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:52,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {2281#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2282#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:52,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#(<= main_~i~0 8)} assume !(~i~0 < 1024); {2270#false} is VALID [2022-04-15 05:45:52,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {2270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2270#false} is VALID [2022-04-15 05:45:52,614 INFO L272 TraceCheckUtils]: 24: Hoare triple {2270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2270#false} is VALID [2022-04-15 05:45:52,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#false} ~cond := #in~cond; {2270#false} is VALID [2022-04-15 05:45:52,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {2270#false} assume 0 == ~cond; {2270#false} is VALID [2022-04-15 05:45:52,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-15 05:45:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:52,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964958990] [2022-04-15 05:45:52,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964958990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:52,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997871780] [2022-04-15 05:45:52,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:45:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:52,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:52,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:45:52,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:45:52,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:52,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 05:45:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:52,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:52,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2269#true} is VALID [2022-04-15 05:45:52,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#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(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-15 05:45:52,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-15 05:45:52,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-15 05:45:52,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret6 := main(); {2269#true} is VALID [2022-04-15 05:45:52,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2302#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:52,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {2302#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2302#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:52,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {2302#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2275#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:52,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {2275#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2275#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:52,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {2275#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:52,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {2276#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2276#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:52,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:52,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {2277#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2277#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:52,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {2277#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:52,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2278#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:52,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:52,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {2279#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2279#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:52,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {2279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:52,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {2280#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2280#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:52,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {2280#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2281#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:52,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {2281#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2281#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:52,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {2281#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2282#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:52,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#(<= main_~i~0 8)} assume !(~i~0 < 1024); {2270#false} is VALID [2022-04-15 05:45:52,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {2270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2270#false} is VALID [2022-04-15 05:45:52,842 INFO L272 TraceCheckUtils]: 24: Hoare triple {2270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2270#false} is VALID [2022-04-15 05:45:52,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#false} ~cond := #in~cond; {2270#false} is VALID [2022-04-15 05:45:52,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {2270#false} assume 0 == ~cond; {2270#false} is VALID [2022-04-15 05:45:52,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-15 05:45:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:52,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:53,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {2270#false} assume !false; {2270#false} is VALID [2022-04-15 05:45:53,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {2270#false} assume 0 == ~cond; {2270#false} is VALID [2022-04-15 05:45:53,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {2270#false} ~cond := #in~cond; {2270#false} is VALID [2022-04-15 05:45:53,099 INFO L272 TraceCheckUtils]: 24: Hoare triple {2270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2270#false} is VALID [2022-04-15 05:45:53,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {2270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2270#false} is VALID [2022-04-15 05:45:53,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {2384#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2270#false} is VALID [2022-04-15 05:45:53,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {2388#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2384#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:53,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {2388#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2388#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:53,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {2395#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2388#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:53,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {2395#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2395#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:53,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {2402#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2395#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:53,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {2402#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2402#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:53,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {2409#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2402#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:53,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {2409#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2409#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:53,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2416#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2409#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:53,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {2416#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2416#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:53,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2416#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:53,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2423#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:53,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2423#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:53,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2430#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:53,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {2437#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2430#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:53,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2437#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:53,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2437#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:53,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {2269#true} call #t~ret6 := main(); {2269#true} is VALID [2022-04-15 05:45:53,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2269#true} {2269#true} #39#return; {2269#true} is VALID [2022-04-15 05:45:53,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2269#true} assume true; {2269#true} is VALID [2022-04-15 05:45:53,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {2269#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(12, 2);call #Ultimate.allocInit(12, 3); {2269#true} is VALID [2022-04-15 05:45:53,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {2269#true} call ULTIMATE.init(); {2269#true} is VALID [2022-04-15 05:45:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:53,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997871780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:53,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:53,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 05:45:53,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:53,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914232497] [2022-04-15 05:45:53,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914232497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:53,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:53,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:45:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857118887] [2022-04-15 05:45:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:53,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:45:53,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:53,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:53,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:45:53,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:53,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:45:53,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:45:53,133 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:53,343 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 05:45:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:45:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:45:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-15 05:45:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-15 05:45:53,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-04-15 05:45:53,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:53,377 INFO L225 Difference]: With dead ends: 38 [2022-04-15 05:45:53,377 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 05:45:53,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=402, Invalid=528, Unknown=0, NotChecked=0, Total=930 [2022-04-15 05:45:53,378 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:53,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 05:45:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 05:45:53,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:53,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,402 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,403 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:53,411 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 05:45:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 05:45:53,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:53,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:53,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 05:45:53,411 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 05:45:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:53,412 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 05:45:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 05:45:53,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:53,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:53,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:53,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 05:45:53,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-04-15 05:45:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:53,414 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 05:45:53,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:53,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 05:45:53,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 05:45:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:45:53,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:53,443 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:53,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:53,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 05:45:53,647 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -317560180, now seen corresponding path program 17 times [2022-04-15 05:45:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221663764] [2022-04-15 05:45:53,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:53,650 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:53,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash -317560180, now seen corresponding path program 18 times [2022-04-15 05:45:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664333395] [2022-04-15 05:45:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:53,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:53,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-15 05:45:53,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-15 05:45:53,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-15 05:45:53,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {2681#true} call ULTIMATE.init(); {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:53,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-15 05:45:53,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-15 05:45:53,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-15 05:45:53,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {2681#true} call #t~ret6 := main(); {2681#true} is VALID [2022-04-15 05:45:53,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2686#(= main_~i~0 0)} is VALID [2022-04-15 05:45:53,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {2686#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2686#(= main_~i~0 0)} is VALID [2022-04-15 05:45:53,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {2686#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2687#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:53,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {2687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:53,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {2687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2688#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:53,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:53,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {2688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2689#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:53,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {2689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:53,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {2689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2690#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:53,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2690#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:53,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2691#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:53,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {2691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2691#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:53,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {2691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2692#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:53,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2692#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:53,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2693#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:53,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2693#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:53,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2694#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:53,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2694#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:53,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {2694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2695#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:53,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {2695#(<= main_~i~0 9)} assume !(~i~0 < 1024); {2682#false} is VALID [2022-04-15 05:45:53,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2682#false} is VALID [2022-04-15 05:45:53,761 INFO L272 TraceCheckUtils]: 26: Hoare triple {2682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2682#false} is VALID [2022-04-15 05:45:53,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#false} ~cond := #in~cond; {2682#false} is VALID [2022-04-15 05:45:53,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#false} assume 0 == ~cond; {2682#false} is VALID [2022-04-15 05:45:53,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-04-15 05:45:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:53,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664333395] [2022-04-15 05:45:53,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664333395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:53,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747184950] [2022-04-15 05:45:53,762 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:45:53,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:53,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:53,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 05:45:53,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 05:45:53,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:53,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:45:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:53,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:54,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {2681#true} call ULTIMATE.init(); {2681#true} is VALID [2022-04-15 05:45:54,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#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(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-15 05:45:54,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-15 05:45:54,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-15 05:45:54,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {2681#true} call #t~ret6 := main(); {2681#true} is VALID [2022-04-15 05:45:54,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2715#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:54,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2715#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:54,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2687#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:54,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {2687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:54,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {2687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2688#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:54,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:54,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {2688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2689#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:54,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {2689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:54,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {2689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2690#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:54,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2690#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:54,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2691#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:54,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {2691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2691#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:54,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {2691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2692#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:54,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2692#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:54,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2693#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:54,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2693#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:54,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2694#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:54,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2694#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:54,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {2694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2695#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:54,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {2695#(<= main_~i~0 9)} assume !(~i~0 < 1024); {2682#false} is VALID [2022-04-15 05:45:54,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2682#false} is VALID [2022-04-15 05:45:54,030 INFO L272 TraceCheckUtils]: 26: Hoare triple {2682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2682#false} is VALID [2022-04-15 05:45:54,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#false} ~cond := #in~cond; {2682#false} is VALID [2022-04-15 05:45:54,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#false} assume 0 == ~cond; {2682#false} is VALID [2022-04-15 05:45:54,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-04-15 05:45:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:54,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:54,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-04-15 05:45:54,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#false} assume 0 == ~cond; {2682#false} is VALID [2022-04-15 05:45:54,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {2682#false} ~cond := #in~cond; {2682#false} is VALID [2022-04-15 05:45:54,335 INFO L272 TraceCheckUtils]: 26: Hoare triple {2682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {2682#false} is VALID [2022-04-15 05:45:54,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2682#false} is VALID [2022-04-15 05:45:54,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {2803#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2682#false} is VALID [2022-04-15 05:45:54,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {2807#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2803#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:54,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {2807#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2807#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:54,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {2814#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2807#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:54,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {2814#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2814#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:54,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {2821#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2814#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:54,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {2821#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2821#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:54,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {2828#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2821#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:54,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {2828#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2828#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:54,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {2835#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2828#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:54,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {2835#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2835#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:54,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2835#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:54,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {2842#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2842#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:54,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2849#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2842#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:54,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {2849#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2849#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:54,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2849#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:54,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2856#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:54,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {2863#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2856#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:54,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {2863#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2863#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:54,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {2863#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:54,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {2681#true} call #t~ret6 := main(); {2681#true} is VALID [2022-04-15 05:45:54,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2681#true} {2681#true} #39#return; {2681#true} is VALID [2022-04-15 05:45:54,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume true; {2681#true} is VALID [2022-04-15 05:45:54,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#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(12, 2);call #Ultimate.allocInit(12, 3); {2681#true} is VALID [2022-04-15 05:45:54,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {2681#true} call ULTIMATE.init(); {2681#true} is VALID [2022-04-15 05:45:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:54,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747184950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:54,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:54,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:45:54,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:54,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221663764] [2022-04-15 05:45:54,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221663764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:54,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:54,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:45:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143730775] [2022-04-15 05:45:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:45:54,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:54,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:54,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:45:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:54,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:45:54,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:45:54,371 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:54,591 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 05:45:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:45:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:45:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 05:45:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 05:45:54,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-15 05:45:54,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:54,624 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:45:54,624 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 05:45:54,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:45:54,625 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:54,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 05:45:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 05:45:54,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:54,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,657 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,658 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:54,659 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:45:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 05:45:54,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:54,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:54,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 05:45:54,661 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 05:45:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:54,661 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:45:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 05:45:54,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:54,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:54,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:54,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 05:45:54,663 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2022-04-15 05:45:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:54,663 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 05:45:54,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:54,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 05:45:54,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 05:45:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:45:54,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:54,691 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:54,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:54,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 05:45:54,892 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1106742514, now seen corresponding path program 19 times [2022-04-15 05:45:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:54,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648908412] [2022-04-15 05:45:54,894 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:54,894 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:54,894 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1106742514, now seen corresponding path program 20 times [2022-04-15 05:45:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:54,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26495166] [2022-04-15 05:45:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:55,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {3137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-15 05:45:55,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-15 05:45:55,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-15 05:45:55,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {3121#true} call ULTIMATE.init(); {3137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:55,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {3137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-15 05:45:55,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-15 05:45:55,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-15 05:45:55,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {3121#true} call #t~ret6 := main(); {3121#true} is VALID [2022-04-15 05:45:55,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {3121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3126#(= main_~i~0 0)} is VALID [2022-04-15 05:45:55,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {3126#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3126#(= main_~i~0 0)} is VALID [2022-04-15 05:45:55,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {3126#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3127#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:55,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {3127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3127#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:55,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3128#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:55,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {3128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3128#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:55,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {3128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3129#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:55,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3129#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:55,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3130#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:55,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3130#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:55,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3131#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:55,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {3131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3131#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:55,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3132#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:55,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3132#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:55,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {3132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3133#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:55,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {3133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3133#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:55,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {3133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3134#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:55,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {3134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3134#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:55,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {3134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3135#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:55,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {3135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3135#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:55,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {3135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3136#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:55,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(<= main_~i~0 10)} assume !(~i~0 < 1024); {3122#false} is VALID [2022-04-15 05:45:55,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {3122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3122#false} is VALID [2022-04-15 05:45:55,035 INFO L272 TraceCheckUtils]: 28: Hoare triple {3122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3122#false} is VALID [2022-04-15 05:45:55,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#false} ~cond := #in~cond; {3122#false} is VALID [2022-04-15 05:45:55,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {3122#false} assume 0 == ~cond; {3122#false} is VALID [2022-04-15 05:45:55,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {3122#false} assume !false; {3122#false} is VALID [2022-04-15 05:45:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:55,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26495166] [2022-04-15 05:45:55,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26495166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:55,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116877324] [2022-04-15 05:45:55,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:45:55,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:55,040 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:55,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 05:45:55,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:45:55,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:55,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:45:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:55,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:55,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {3121#true} call ULTIMATE.init(); {3121#true} is VALID [2022-04-15 05:45:55,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {3121#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(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-15 05:45:55,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-15 05:45:55,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-15 05:45:55,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {3121#true} call #t~ret6 := main(); {3121#true} is VALID [2022-04-15 05:45:55,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {3121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3156#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:55,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {3156#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3156#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:55,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {3156#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3127#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:55,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {3127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3127#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:55,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {3127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3128#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:55,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {3128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3128#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:55,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {3128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3129#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:55,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3129#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:55,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3130#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:55,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3130#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:55,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3131#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:55,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {3131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3131#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:55,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3132#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:55,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3132#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:55,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {3132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3133#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:55,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {3133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3133#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:55,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {3133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3134#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:55,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {3134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3134#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:55,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {3134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3135#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:55,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {3135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3135#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:55,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {3135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3136#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:55,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(<= main_~i~0 10)} assume !(~i~0 < 1024); {3122#false} is VALID [2022-04-15 05:45:55,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {3122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3122#false} is VALID [2022-04-15 05:45:55,303 INFO L272 TraceCheckUtils]: 28: Hoare triple {3122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3122#false} is VALID [2022-04-15 05:45:55,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#false} ~cond := #in~cond; {3122#false} is VALID [2022-04-15 05:45:55,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {3122#false} assume 0 == ~cond; {3122#false} is VALID [2022-04-15 05:45:55,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {3122#false} assume !false; {3122#false} is VALID [2022-04-15 05:45:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:55,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:55,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {3122#false} assume !false; {3122#false} is VALID [2022-04-15 05:45:55,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {3122#false} assume 0 == ~cond; {3122#false} is VALID [2022-04-15 05:45:55,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#false} ~cond := #in~cond; {3122#false} is VALID [2022-04-15 05:45:55,629 INFO L272 TraceCheckUtils]: 28: Hoare triple {3122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3122#false} is VALID [2022-04-15 05:45:55,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {3122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3122#false} is VALID [2022-04-15 05:45:55,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {3250#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3122#false} is VALID [2022-04-15 05:45:55,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {3254#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3250#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:55,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {3254#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3254#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:55,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {3261#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3254#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:55,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {3261#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3261#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:55,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {3268#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3261#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:55,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {3268#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3268#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:55,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {3275#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3268#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:55,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {3275#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3275#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:55,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {3282#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3275#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:55,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {3282#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3282#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:55,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3282#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:55,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3289#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:55,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {3296#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3289#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:55,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {3296#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3296#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:55,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3296#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:55,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {3303#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3303#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:55,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {3310#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3303#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:55,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3310#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:55,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3310#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:55,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3317#(< main_~i~0 1014)} is VALID [2022-04-15 05:45:55,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {3121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3317#(< main_~i~0 1014)} is VALID [2022-04-15 05:45:55,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {3121#true} call #t~ret6 := main(); {3121#true} is VALID [2022-04-15 05:45:55,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3121#true} {3121#true} #39#return; {3121#true} is VALID [2022-04-15 05:45:55,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {3121#true} assume true; {3121#true} is VALID [2022-04-15 05:45:55,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {3121#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(12, 2);call #Ultimate.allocInit(12, 3); {3121#true} is VALID [2022-04-15 05:45:55,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {3121#true} call ULTIMATE.init(); {3121#true} is VALID [2022-04-15 05:45:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:55,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116877324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:55,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:55,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:45:55,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:55,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648908412] [2022-04-15 05:45:55,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648908412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:55,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:55,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:45:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135089501] [2022-04-15 05:45:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 05:45:55,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:55,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:55,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:55,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:45:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:45:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:45:55,671 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:55,948 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 05:45:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:45:55,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 05:45:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-15 05:45:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-15 05:45:55,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 42 transitions. [2022-04-15 05:45:55,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:55,982 INFO L225 Difference]: With dead ends: 42 [2022-04-15 05:45:55,982 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 05:45:55,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 05:45:55,983 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:55,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 54 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:45:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 05:45:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 05:45:56,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:56,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:56,030 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:56,030 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:56,031 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:45:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 05:45:56,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:56,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:56,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 05:45:56,031 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 05:45:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:56,032 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:45:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 05:45:56,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:56,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:56,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:56,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 05:45:56,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2022-04-15 05:45:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:56,034 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 05:45:56,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:56,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 05:45:56,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 05:45:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 05:45:56,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:56,064 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:56,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:56,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 05:45:56,279 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 698245904, now seen corresponding path program 21 times [2022-04-15 05:45:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:56,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1247713836] [2022-04-15 05:45:56,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:56,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:56,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 698245904, now seen corresponding path program 22 times [2022-04-15 05:45:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:56,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130577311] [2022-04-15 05:45:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:56,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-15 05:45:56,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 05:45:56,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-15 05:45:56,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:56,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-15 05:45:56,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 05:45:56,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-15 05:45:56,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret6 := main(); {3589#true} is VALID [2022-04-15 05:45:56,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3594#(= main_~i~0 0)} is VALID [2022-04-15 05:45:56,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {3594#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3594#(= main_~i~0 0)} is VALID [2022-04-15 05:45:56,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3595#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:56,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {3595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3595#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:56,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {3595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3596#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:56,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {3596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3596#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:56,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3597#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:56,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3597#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:56,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3598#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:56,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {3598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3598#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:56,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {3598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:56,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3599#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:56,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3600#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:56,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {3600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3600#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:56,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {3600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3601#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:56,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3601#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:56,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3602#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:56,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {3602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3602#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:56,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {3602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3603#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:56,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {3603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3603#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:56,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {3603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:56,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {3604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3604#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:56,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {3604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3605#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:56,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {3605#(<= main_~i~0 11)} assume !(~i~0 < 1024); {3590#false} is VALID [2022-04-15 05:45:56,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3590#false} is VALID [2022-04-15 05:45:56,426 INFO L272 TraceCheckUtils]: 30: Hoare triple {3590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3590#false} is VALID [2022-04-15 05:45:56,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-15 05:45:56,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-15 05:45:56,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-15 05:45:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:56,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130577311] [2022-04-15 05:45:56,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130577311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:56,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097944011] [2022-04-15 05:45:56,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:45:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:56,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:56,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 05:45:56,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:45:56,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:56,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:45:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:56,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:56,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3589#true} is VALID [2022-04-15 05:45:56,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#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(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-15 05:45:56,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 05:45:56,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-15 05:45:56,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret6 := main(); {3589#true} is VALID [2022-04-15 05:45:56,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3625#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:56,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {3625#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3625#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:56,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {3625#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3595#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:56,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {3595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3595#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:56,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {3595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3596#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:56,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {3596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3596#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:56,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3597#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:56,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3597#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:56,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3598#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:56,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {3598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3598#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:56,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {3598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:56,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3599#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:56,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {3599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3600#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:56,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {3600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3600#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:56,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {3600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3601#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:56,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3601#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:56,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3602#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:56,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {3602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3602#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:56,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {3602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3603#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:56,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {3603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3603#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:56,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {3603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:56,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {3604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3604#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:56,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {3604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3605#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:56,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {3605#(<= main_~i~0 11)} assume !(~i~0 < 1024); {3590#false} is VALID [2022-04-15 05:45:56,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3590#false} is VALID [2022-04-15 05:45:56,695 INFO L272 TraceCheckUtils]: 30: Hoare triple {3590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3590#false} is VALID [2022-04-15 05:45:56,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-15 05:45:56,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-15 05:45:56,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-15 05:45:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:56,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:57,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#false} assume !false; {3590#false} is VALID [2022-04-15 05:45:57,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#false} assume 0 == ~cond; {3590#false} is VALID [2022-04-15 05:45:57,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#false} ~cond := #in~cond; {3590#false} is VALID [2022-04-15 05:45:57,047 INFO L272 TraceCheckUtils]: 30: Hoare triple {3590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {3590#false} is VALID [2022-04-15 05:45:57,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3590#false} is VALID [2022-04-15 05:45:57,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {3725#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3590#false} is VALID [2022-04-15 05:45:57,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {3729#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3725#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:57,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {3729#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3729#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:57,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {3736#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3729#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:57,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {3736#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3736#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:57,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {3743#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3736#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:57,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {3743#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3743#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:57,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {3750#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3743#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:57,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {3750#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3750#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:57,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {3757#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3750#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:57,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {3757#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3757#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:57,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {3764#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3757#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:57,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {3764#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3764#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:57,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {3771#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3764#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:57,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {3771#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3771#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:57,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {3778#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3771#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:57,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {3778#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3778#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:57,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {3785#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3778#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:57,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {3785#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3785#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:57,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3785#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:57,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3792#(< main_~i~0 1014)} is VALID [2022-04-15 05:45:57,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {3799#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3792#(< main_~i~0 1014)} is VALID [2022-04-15 05:45:57,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {3799#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3799#(< main_~i~0 1013)} is VALID [2022-04-15 05:45:57,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {3589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {3799#(< main_~i~0 1013)} is VALID [2022-04-15 05:45:57,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {3589#true} call #t~ret6 := main(); {3589#true} is VALID [2022-04-15 05:45:57,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3589#true} {3589#true} #39#return; {3589#true} is VALID [2022-04-15 05:45:57,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {3589#true} assume true; {3589#true} is VALID [2022-04-15 05:45:57,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {3589#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(12, 2);call #Ultimate.allocInit(12, 3); {3589#true} is VALID [2022-04-15 05:45:57,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {3589#true} call ULTIMATE.init(); {3589#true} is VALID [2022-04-15 05:45:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:57,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097944011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:57,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:57,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 05:45:57,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:57,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1247713836] [2022-04-15 05:45:57,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1247713836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:57,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:57,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:45:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371478760] [2022-04-15 05:45:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 05:45:57,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:57,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:57,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:45:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:45:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:45:57,083 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:57,348 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 05:45:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:45:57,349 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 05:45:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-15 05:45:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-15 05:45:57,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2022-04-15 05:45:57,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:57,391 INFO L225 Difference]: With dead ends: 44 [2022-04-15 05:45:57,391 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 05:45:57,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=678, Invalid=882, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:45:57,392 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:57,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 05:45:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 05:45:57,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:57,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,431 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,432 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:57,432 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 05:45:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 05:45:57,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:57,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:57,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 05:45:57,433 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 05:45:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:57,434 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 05:45:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 05:45:57,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:57,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:57,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:57,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 05:45:57,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-04-15 05:45:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:57,435 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 05:45:57,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:57,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 05:45:57,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 05:45:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:45:57,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:57,472 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:57,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:57,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 05:45:57,673 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 125328018, now seen corresponding path program 23 times [2022-04-15 05:45:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:57,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [31594433] [2022-04-15 05:45:57,676 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:57,676 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:57,676 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash 125328018, now seen corresponding path program 24 times [2022-04-15 05:45:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:57,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922223102] [2022-04-15 05:45:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:57,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-15 05:45:57,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-15 05:45:57,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-15 05:45:57,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:57,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-15 05:45:57,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-15 05:45:57,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-15 05:45:57,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret6 := main(); {4085#true} is VALID [2022-04-15 05:45:57,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4090#(= main_~i~0 0)} is VALID [2022-04-15 05:45:57,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {4090#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4090#(= main_~i~0 0)} is VALID [2022-04-15 05:45:57,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {4090#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4091#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:57,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {4091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4091#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:57,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {4091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4092#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:57,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {4092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4092#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:57,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {4092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4093#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:57,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {4093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4093#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:57,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {4093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:57,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {4094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4094#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:57,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {4094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4095#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:57,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {4095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4095#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:57,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {4095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4096#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:57,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {4096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4096#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:57,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {4096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4097#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:57,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {4097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4097#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:57,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {4097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4098#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:57,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {4098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4098#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:57,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {4098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4099#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:57,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {4099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4099#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:57,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4100#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:57,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4100#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:57,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4101#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:57,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {4101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4101#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:57,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {4101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4102#(<= main_~i~0 12)} is VALID [2022-04-15 05:45:57,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {4102#(<= main_~i~0 12)} assume !(~i~0 < 1024); {4086#false} is VALID [2022-04-15 05:45:57,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4086#false} is VALID [2022-04-15 05:45:57,842 INFO L272 TraceCheckUtils]: 32: Hoare triple {4086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4086#false} is VALID [2022-04-15 05:45:57,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-15 05:45:57,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-15 05:45:57,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-15 05:45:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922223102] [2022-04-15 05:45:57,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922223102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309226762] [2022-04-15 05:45:57,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:45:57,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:57,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:57,844 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:57,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 05:45:57,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 05:45:57,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:57,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 05:45:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:58,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:58,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2022-04-15 05:45:58,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#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(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-15 05:45:58,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-15 05:45:58,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-15 05:45:58,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret6 := main(); {4085#true} is VALID [2022-04-15 05:45:58,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4122#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:58,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {4122#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:58,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {4122#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4091#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:58,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {4091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4091#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:58,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {4091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4092#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:58,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {4092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4092#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:58,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {4092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4093#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:58,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {4093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4093#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:58,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {4093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:58,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {4094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4094#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:58,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {4094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4095#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:58,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {4095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4095#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:58,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {4095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4096#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:58,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {4096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4096#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:58,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {4096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4097#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:58,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {4097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4097#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:58,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {4097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4098#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:58,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {4098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4098#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:58,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {4098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4099#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:58,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {4099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4099#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:58,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4100#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:58,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4100#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:58,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4101#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:58,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {4101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4101#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:58,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {4101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4102#(<= main_~i~0 12)} is VALID [2022-04-15 05:45:58,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {4102#(<= main_~i~0 12)} assume !(~i~0 < 1024); {4086#false} is VALID [2022-04-15 05:45:58,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4086#false} is VALID [2022-04-15 05:45:58,219 INFO L272 TraceCheckUtils]: 32: Hoare triple {4086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4086#false} is VALID [2022-04-15 05:45:58,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-15 05:45:58,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-15 05:45:58,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-15 05:45:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:58,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:45:58,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-15 05:45:58,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-15 05:45:58,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-15 05:45:58,671 INFO L272 TraceCheckUtils]: 32: Hoare triple {4086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4086#false} is VALID [2022-04-15 05:45:58,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4086#false} is VALID [2022-04-15 05:45:58,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {4228#(< main_~i~0 1024)} assume !(~i~0 < 1024); {4086#false} is VALID [2022-04-15 05:45:58,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {4232#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4228#(< main_~i~0 1024)} is VALID [2022-04-15 05:45:58,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {4232#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4232#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:58,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {4239#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(< main_~i~0 1023)} is VALID [2022-04-15 05:45:58,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {4239#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4239#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:58,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4239#(< main_~i~0 1022)} is VALID [2022-04-15 05:45:58,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4246#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:58,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4246#(< main_~i~0 1021)} is VALID [2022-04-15 05:45:58,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4253#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:58,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {4260#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4253#(< main_~i~0 1020)} is VALID [2022-04-15 05:45:58,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {4260#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4260#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:58,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {4267#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4260#(< main_~i~0 1019)} is VALID [2022-04-15 05:45:58,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {4267#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4267#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:58,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {4274#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4267#(< main_~i~0 1018)} is VALID [2022-04-15 05:45:58,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {4274#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4274#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:58,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {4281#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4274#(< main_~i~0 1017)} is VALID [2022-04-15 05:45:58,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {4281#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4281#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:58,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4281#(< main_~i~0 1016)} is VALID [2022-04-15 05:45:58,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {4288#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4288#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:58,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {4295#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4288#(< main_~i~0 1015)} is VALID [2022-04-15 05:45:58,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {4295#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4295#(< main_~i~0 1014)} is VALID [2022-04-15 05:45:58,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {4302#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4295#(< main_~i~0 1014)} is VALID [2022-04-15 05:45:58,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {4302#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4302#(< main_~i~0 1013)} is VALID [2022-04-15 05:45:58,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {4309#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4302#(< main_~i~0 1013)} is VALID [2022-04-15 05:45:58,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {4309#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4309#(< main_~i~0 1012)} is VALID [2022-04-15 05:45:58,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4309#(< main_~i~0 1012)} is VALID [2022-04-15 05:45:58,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret6 := main(); {4085#true} is VALID [2022-04-15 05:45:58,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #39#return; {4085#true} is VALID [2022-04-15 05:45:58,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-15 05:45:58,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#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(12, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-15 05:45:58,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2022-04-15 05:45:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:58,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309226762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:45:58,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:45:58,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 05:45:58,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:45:58,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [31594433] [2022-04-15 05:45:58,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [31594433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:45:58,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:45:58,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:45:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950658414] [2022-04-15 05:45:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:45:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 05:45:58,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:45:58,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:58,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:58,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:45:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:45:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:45:58,712 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:59,015 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 05:45:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:45:59,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 05:45:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:45:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 05:45:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 05:45:59,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-15 05:45:59,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:59,052 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:45:59,052 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 05:45:59,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 05:45:59,053 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:45:59,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:45:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 05:45:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 05:45:59,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:45:59,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,096 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,096 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:59,097 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 05:45:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 05:45:59,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:59,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:59,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 05:45:59,098 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 05:45:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:45:59,099 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 05:45:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 05:45:59,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:45:59,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:45:59,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:45:59,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:45:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 05:45:59,100 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-04-15 05:45:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:45:59,100 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 05:45:59,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:45:59,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 05:45:59,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:45:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 05:45:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:45:59,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:45:59,150 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:45:59,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 05:45:59,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 05:45:59,359 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:45:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:45:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash -692946540, now seen corresponding path program 25 times [2022-04-15 05:45:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:45:59,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919717131] [2022-04-15 05:45:59,362 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:45:59,362 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:45:59,362 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:45:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -692946540, now seen corresponding path program 26 times [2022-04-15 05:45:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:45:59,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442362040] [2022-04-15 05:45:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:45:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:45:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:45:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:59,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-15 05:45:59,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-15 05:45:59,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-15 05:45:59,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {4609#true} call ULTIMATE.init(); {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:45:59,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-15 05:45:59,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-15 05:45:59,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-15 05:45:59,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#true} call #t~ret6 := main(); {4609#true} is VALID [2022-04-15 05:45:59,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4614#(= main_~i~0 0)} is VALID [2022-04-15 05:45:59,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {4614#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4614#(= main_~i~0 0)} is VALID [2022-04-15 05:45:59,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {4614#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4615#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:59,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {4615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4615#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:59,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {4615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4616#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:59,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {4616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4616#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:59,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {4616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4617#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:59,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {4617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4617#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:59,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {4617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4618#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:59,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {4618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4618#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:59,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {4618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4619#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:59,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {4619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4619#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:59,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {4619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4620#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:59,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {4620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4620#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:59,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {4620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4621#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:59,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {4621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4621#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:59,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {4621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4622#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:59,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {4622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4622#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:59,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {4622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4623#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:59,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {4623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4623#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:59,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4624#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:59,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {4624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4624#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:59,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {4624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4625#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:59,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {4625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4625#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:59,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {4625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4626#(<= main_~i~0 12)} is VALID [2022-04-15 05:45:59,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {4626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4626#(<= main_~i~0 12)} is VALID [2022-04-15 05:45:59,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {4626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4627#(<= main_~i~0 13)} is VALID [2022-04-15 05:45:59,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {4627#(<= main_~i~0 13)} assume !(~i~0 < 1024); {4610#false} is VALID [2022-04-15 05:45:59,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {4610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4610#false} is VALID [2022-04-15 05:45:59,528 INFO L272 TraceCheckUtils]: 34: Hoare triple {4610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4610#false} is VALID [2022-04-15 05:45:59,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {4610#false} ~cond := #in~cond; {4610#false} is VALID [2022-04-15 05:45:59,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#false} assume 0 == ~cond; {4610#false} is VALID [2022-04-15 05:45:59,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#false} assume !false; {4610#false} is VALID [2022-04-15 05:45:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:45:59,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442362040] [2022-04-15 05:45:59,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442362040] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:45:59,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969810751] [2022-04-15 05:45:59,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:45:59,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:45:59,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:45:59,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:45:59,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 05:45:59,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:45:59,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:45:59,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 05:45:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:45:59,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:45:59,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {4609#true} call ULTIMATE.init(); {4609#true} is VALID [2022-04-15 05:45:59,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#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(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-15 05:45:59,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-15 05:45:59,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-15 05:45:59,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#true} call #t~ret6 := main(); {4609#true} is VALID [2022-04-15 05:45:59,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4647#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:59,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {4647#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4647#(<= main_~i~0 0)} is VALID [2022-04-15 05:45:59,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4615#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:59,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {4615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4615#(<= main_~i~0 1)} is VALID [2022-04-15 05:45:59,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {4615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4616#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:59,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {4616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4616#(<= main_~i~0 2)} is VALID [2022-04-15 05:45:59,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {4616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4617#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:59,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {4617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4617#(<= main_~i~0 3)} is VALID [2022-04-15 05:45:59,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {4617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4618#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:59,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {4618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4618#(<= main_~i~0 4)} is VALID [2022-04-15 05:45:59,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {4618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4619#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:59,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {4619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4619#(<= main_~i~0 5)} is VALID [2022-04-15 05:45:59,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {4619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4620#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:59,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {4620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4620#(<= main_~i~0 6)} is VALID [2022-04-15 05:45:59,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {4620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4621#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:59,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {4621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4621#(<= main_~i~0 7)} is VALID [2022-04-15 05:45:59,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {4621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4622#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:59,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {4622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4622#(<= main_~i~0 8)} is VALID [2022-04-15 05:45:59,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {4622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4623#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:59,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {4623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4623#(<= main_~i~0 9)} is VALID [2022-04-15 05:45:59,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4624#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:59,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {4624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4624#(<= main_~i~0 10)} is VALID [2022-04-15 05:45:59,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {4624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4625#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:59,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {4625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4625#(<= main_~i~0 11)} is VALID [2022-04-15 05:45:59,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {4625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4626#(<= main_~i~0 12)} is VALID [2022-04-15 05:45:59,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {4626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4626#(<= main_~i~0 12)} is VALID [2022-04-15 05:45:59,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {4626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4627#(<= main_~i~0 13)} is VALID [2022-04-15 05:45:59,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {4627#(<= main_~i~0 13)} assume !(~i~0 < 1024); {4610#false} is VALID [2022-04-15 05:45:59,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {4610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4610#false} is VALID [2022-04-15 05:45:59,811 INFO L272 TraceCheckUtils]: 34: Hoare triple {4610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4610#false} is VALID [2022-04-15 05:45:59,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {4610#false} ~cond := #in~cond; {4610#false} is VALID [2022-04-15 05:45:59,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#false} assume 0 == ~cond; {4610#false} is VALID [2022-04-15 05:45:59,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#false} assume !false; {4610#false} is VALID [2022-04-15 05:45:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:45:59,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:00,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#false} assume !false; {4610#false} is VALID [2022-04-15 05:46:00,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#false} assume 0 == ~cond; {4610#false} is VALID [2022-04-15 05:46:00,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {4610#false} ~cond := #in~cond; {4610#false} is VALID [2022-04-15 05:46:00,294 INFO L272 TraceCheckUtils]: 34: Hoare triple {4610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {4610#false} is VALID [2022-04-15 05:46:00,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {4610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4610#false} is VALID [2022-04-15 05:46:00,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {4759#(< main_~i~0 1024)} assume !(~i~0 < 1024); {4610#false} is VALID [2022-04-15 05:46:00,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {4763#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4759#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:00,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {4763#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4763#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:00,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4763#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:00,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {4770#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4770#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:00,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {4777#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4770#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:00,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4777#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:00,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {4784#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4777#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:00,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {4784#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4784#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:00,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {4791#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4784#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:00,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {4791#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4791#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:00,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {4798#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4791#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:00,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {4798#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4798#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:00,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {4805#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4798#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:00,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {4805#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4805#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:00,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {4812#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4805#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:00,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {4812#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4812#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:00,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {4819#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4812#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:00,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {4819#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4819#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:00,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {4826#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4819#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:00,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {4826#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4826#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:00,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {4833#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4826#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:00,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {4833#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4833#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:00,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {4840#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4833#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:00,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {4840#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4840#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:00,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {4847#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4840#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:00,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {4847#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4847#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:00,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {4847#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:00,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {4609#true} call #t~ret6 := main(); {4609#true} is VALID [2022-04-15 05:46:00,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4609#true} {4609#true} #39#return; {4609#true} is VALID [2022-04-15 05:46:00,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4609#true} assume true; {4609#true} is VALID [2022-04-15 05:46:00,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#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(12, 2);call #Ultimate.allocInit(12, 3); {4609#true} is VALID [2022-04-15 05:46:00,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {4609#true} call ULTIMATE.init(); {4609#true} is VALID [2022-04-15 05:46:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:00,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969810751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:00,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:00,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:46:00,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:00,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919717131] [2022-04-15 05:46:00,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919717131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:00,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:00,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:46:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423941330] [2022-04-15 05:46:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:00,309 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 05:46:00,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:00,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:00,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:46:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:46:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:46:00,347 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:00,640 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 05:46:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:46:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 05:46:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-15 05:46:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-15 05:46:00,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2022-04-15 05:46:00,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:00,695 INFO L225 Difference]: With dead ends: 48 [2022-04-15 05:46:00,695 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 05:46:00,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:46:00,697 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:00,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:46:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 05:46:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-15 05:46:00,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:00,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,756 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,756 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:00,757 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 05:46:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 05:46:00,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:00,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:00,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 05:46:00,757 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 05:46:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:00,758 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 05:46:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 05:46:00,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:00,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:00,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:00,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 05:46:00,759 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2022-04-15 05:46:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:00,760 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 05:46:00,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:00,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 05:46:00,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 05:46:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 05:46:00,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:00,803 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:00,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:01,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 05:46:01,003 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:01,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1075781610, now seen corresponding path program 27 times [2022-04-15 05:46:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:01,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396355389] [2022-04-15 05:46:01,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:01,006 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:01,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1075781610, now seen corresponding path program 28 times [2022-04-15 05:46:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:01,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486530121] [2022-04-15 05:46:01,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:01,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:01,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {5181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-15 05:46:01,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-15 05:46:01,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-15 05:46:01,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {5161#true} call ULTIMATE.init(); {5181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:01,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {5181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-15 05:46:01,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-15 05:46:01,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-15 05:46:01,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#true} call #t~ret6 := main(); {5161#true} is VALID [2022-04-15 05:46:01,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5166#(= main_~i~0 0)} is VALID [2022-04-15 05:46:01,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {5166#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5166#(= main_~i~0 0)} is VALID [2022-04-15 05:46:01,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {5166#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5167#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:01,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {5167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5167#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:01,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {5167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5168#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:01,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {5168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5168#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:01,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {5168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5169#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:01,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {5169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5169#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:01,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {5169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5170#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:01,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {5170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5170#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:01,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {5170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5171#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:01,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {5171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5171#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:01,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {5171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:01,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5172#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:01,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5173#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:01,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {5173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5173#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:01,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {5173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5174#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:01,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {5174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5174#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:01,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {5174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5175#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:01,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {5175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5175#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:01,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {5175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5176#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:01,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {5176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5176#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:01,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {5176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5177#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:01,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {5177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5177#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:01,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {5177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5178#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:01,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {5178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5178#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:01,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {5178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5179#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:01,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {5179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5179#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:01,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {5179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5180#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:01,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {5180#(<= main_~i~0 14)} assume !(~i~0 < 1024); {5162#false} is VALID [2022-04-15 05:46:01,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {5162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5162#false} is VALID [2022-04-15 05:46:01,183 INFO L272 TraceCheckUtils]: 36: Hoare triple {5162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5162#false} is VALID [2022-04-15 05:46:01,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {5162#false} ~cond := #in~cond; {5162#false} is VALID [2022-04-15 05:46:01,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {5162#false} assume 0 == ~cond; {5162#false} is VALID [2022-04-15 05:46:01,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {5162#false} assume !false; {5162#false} is VALID [2022-04-15 05:46:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:01,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486530121] [2022-04-15 05:46:01,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486530121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:01,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999577612] [2022-04-15 05:46:01,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:46:01,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:01,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:01,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:01,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 05:46:01,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:46:01,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:01,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 05:46:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:01,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:01,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {5161#true} call ULTIMATE.init(); {5161#true} is VALID [2022-04-15 05:46:01,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#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(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-15 05:46:01,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-15 05:46:01,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-15 05:46:01,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#true} call #t~ret6 := main(); {5161#true} is VALID [2022-04-15 05:46:01,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5200#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:01,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {5200#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5200#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:01,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {5200#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5167#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:01,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {5167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5167#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:01,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {5167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5168#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:01,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {5168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5168#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:01,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {5168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5169#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:01,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {5169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5169#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:01,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {5169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5170#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:01,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {5170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5170#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:01,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {5170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5171#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:01,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {5171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5171#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:01,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {5171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:01,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {5172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5172#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:01,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {5172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5173#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:01,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {5173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5173#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:01,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {5173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5174#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:01,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {5174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5174#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:01,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {5174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5175#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:01,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {5175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5175#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:01,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {5175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5176#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:01,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {5176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5176#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:01,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {5176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5177#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:01,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {5177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5177#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:01,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {5177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5178#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:01,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {5178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5178#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:01,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {5178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5179#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:01,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {5179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5179#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:01,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {5179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5180#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:01,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {5180#(<= main_~i~0 14)} assume !(~i~0 < 1024); {5162#false} is VALID [2022-04-15 05:46:01,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {5162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5162#false} is VALID [2022-04-15 05:46:01,477 INFO L272 TraceCheckUtils]: 36: Hoare triple {5162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5162#false} is VALID [2022-04-15 05:46:01,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {5162#false} ~cond := #in~cond; {5162#false} is VALID [2022-04-15 05:46:01,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {5162#false} assume 0 == ~cond; {5162#false} is VALID [2022-04-15 05:46:01,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {5162#false} assume !false; {5162#false} is VALID [2022-04-15 05:46:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:01,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:01,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {5162#false} assume !false; {5162#false} is VALID [2022-04-15 05:46:01,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {5162#false} assume 0 == ~cond; {5162#false} is VALID [2022-04-15 05:46:01,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {5162#false} ~cond := #in~cond; {5162#false} is VALID [2022-04-15 05:46:01,920 INFO L272 TraceCheckUtils]: 36: Hoare triple {5162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5162#false} is VALID [2022-04-15 05:46:01,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {5162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5162#false} is VALID [2022-04-15 05:46:01,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {5318#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5162#false} is VALID [2022-04-15 05:46:01,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {5322#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5318#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:01,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {5322#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5322#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:01,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {5329#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5322#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:01,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {5329#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5329#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:01,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {5336#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5329#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:01,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {5336#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5336#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:01,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {5343#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5336#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:01,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5343#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:01,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {5350#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5343#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:01,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {5350#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5350#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:01,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {5357#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5350#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:01,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {5357#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5357#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:01,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {5364#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5357#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:01,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {5364#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5364#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:01,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {5371#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5364#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:01,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {5371#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5371#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:01,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {5378#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5371#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:01,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {5378#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5378#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:01,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5385#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5378#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:01,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {5385#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5385#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:01,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {5392#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5385#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:01,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {5392#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5392#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:01,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {5399#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5392#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:01,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {5399#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5399#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:01,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5399#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:01,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5406#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:01,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {5413#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5406#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:01,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {5413#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5413#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:01,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {5161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5413#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:01,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {5161#true} call #t~ret6 := main(); {5161#true} is VALID [2022-04-15 05:46:01,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5161#true} {5161#true} #39#return; {5161#true} is VALID [2022-04-15 05:46:01,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {5161#true} assume true; {5161#true} is VALID [2022-04-15 05:46:01,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#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(12, 2);call #Ultimate.allocInit(12, 3); {5161#true} is VALID [2022-04-15 05:46:01,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {5161#true} call ULTIMATE.init(); {5161#true} is VALID [2022-04-15 05:46:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:01,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999577612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:01,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:01,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 05:46:01,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:01,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396355389] [2022-04-15 05:46:01,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396355389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:01,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:01,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:46:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130646312] [2022-04-15 05:46:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 05:46:01,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:01,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:01,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:01,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:46:01,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:01,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:46:01,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:46:01,979 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:02,294 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 05:46:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:46:02,294 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 05:46:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-15 05:46:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-15 05:46:02,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 50 transitions. [2022-04-15 05:46:02,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:02,337 INFO L225 Difference]: With dead ends: 50 [2022-04-15 05:46:02,337 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 05:46:02,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1026, Invalid=1326, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 05:46:02,339 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:02,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:46:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 05:46:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 05:46:02,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:02,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,409 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,409 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:02,410 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 05:46:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 05:46:02,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:02,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:02,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 05:46:02,410 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 05:46:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:02,411 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 05:46:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 05:46:02,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:02,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:02,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:02,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 05:46:02,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2022-04-15 05:46:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:02,413 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 05:46:02,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:02,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 05:46:02,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 05:46:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 05:46:02,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:02,455 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:02,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 05:46:02,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:02,656 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 386903576, now seen corresponding path program 29 times [2022-04-15 05:46:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1375533822] [2022-04-15 05:46:02,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:02,658 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:02,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 386903576, now seen corresponding path program 30 times [2022-04-15 05:46:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:02,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568227682] [2022-04-15 05:46:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:02,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:02,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {5762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-15 05:46:02,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-15 05:46:02,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-15 05:46:02,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:02,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {5762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-15 05:46:02,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-15 05:46:02,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-15 05:46:02,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret6 := main(); {5741#true} is VALID [2022-04-15 05:46:02,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5746#(= main_~i~0 0)} is VALID [2022-04-15 05:46:02,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {5746#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5746#(= main_~i~0 0)} is VALID [2022-04-15 05:46:02,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {5746#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5747#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:02,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5747#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:02,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5748#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:02,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {5748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5748#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:02,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {5748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5749#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:02,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {5749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5749#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:02,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {5749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5750#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:02,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {5750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5750#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:02,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {5750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5751#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:02,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {5751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5751#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:02,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {5751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5752#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:02,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {5752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5752#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:02,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {5752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5753#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:02,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5753#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:02,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5754#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:02,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {5754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5754#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:02,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {5754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5755#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:02,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {5755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5755#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:02,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {5755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5756#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:02,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {5756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5756#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:02,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {5756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5757#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:02,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {5757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5757#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:02,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {5757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5758#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:02,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {5758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5758#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:02,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {5758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5759#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:02,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {5759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5759#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:02,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {5759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5760#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:02,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {5760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5760#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:02,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {5760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5761#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:02,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {5761#(<= main_~i~0 15)} assume !(~i~0 < 1024); {5742#false} is VALID [2022-04-15 05:46:02,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {5742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5742#false} is VALID [2022-04-15 05:46:02,857 INFO L272 TraceCheckUtils]: 38: Hoare triple {5742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5742#false} is VALID [2022-04-15 05:46:02,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2022-04-15 05:46:02,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2022-04-15 05:46:02,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2022-04-15 05:46:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:02,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568227682] [2022-04-15 05:46:02,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568227682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:02,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869168965] [2022-04-15 05:46:02,857 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:46:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:02,858 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:02,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 05:46:03,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 05:46:03,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:03,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:46:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:03,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:03,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5741#true} is VALID [2022-04-15 05:46:03,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#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(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-15 05:46:03,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-15 05:46:03,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-15 05:46:03,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret6 := main(); {5741#true} is VALID [2022-04-15 05:46:03,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {5781#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:03,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {5781#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5781#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:03,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {5781#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5747#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:03,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {5747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5747#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:03,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {5747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5748#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:03,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {5748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5748#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:03,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {5748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5749#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:03,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {5749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5749#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:03,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {5749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5750#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:03,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {5750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5750#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:03,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {5750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5751#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:03,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {5751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5751#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:03,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {5751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5752#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:03,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {5752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5752#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:03,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {5752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5753#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:03,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {5753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5753#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:03,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {5753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5754#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:03,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {5754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5754#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:03,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {5754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5755#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:03,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {5755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5755#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:03,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {5755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5756#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:03,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {5756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5756#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:03,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {5756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5757#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:03,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {5757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5757#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:03,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {5757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5758#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:03,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {5758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5758#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:03,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {5758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5759#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:03,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {5759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5759#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:03,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {5759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5760#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:03,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {5760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5760#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:03,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {5760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5761#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:03,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {5761#(<= main_~i~0 15)} assume !(~i~0 < 1024); {5742#false} is VALID [2022-04-15 05:46:03,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {5742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5742#false} is VALID [2022-04-15 05:46:03,294 INFO L272 TraceCheckUtils]: 38: Hoare triple {5742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5742#false} is VALID [2022-04-15 05:46:03,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2022-04-15 05:46:03,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2022-04-15 05:46:03,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2022-04-15 05:46:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:03,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:03,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2022-04-15 05:46:03,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2022-04-15 05:46:03,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2022-04-15 05:46:03,782 INFO L272 TraceCheckUtils]: 38: Hoare triple {5742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {5742#false} is VALID [2022-04-15 05:46:03,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {5742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5742#false} is VALID [2022-04-15 05:46:03,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {5905#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5742#false} is VALID [2022-04-15 05:46:03,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {5909#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5905#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:03,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {5909#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5909#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:03,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {5916#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5909#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:03,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {5916#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5916#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:03,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {5923#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5916#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:03,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {5923#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5923#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:03,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {5930#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5923#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:03,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {5930#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5930#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:03,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {5937#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5930#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:03,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {5937#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5937#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:03,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {5944#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5937#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:03,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5944#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:03,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {5951#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5944#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:03,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {5951#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5951#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:03,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {5958#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5951#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:03,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {5958#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5958#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:03,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {5965#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5958#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:03,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {5965#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5965#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:03,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {5972#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5965#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:03,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {5972#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5972#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:03,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {5979#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5972#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:03,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {5979#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5979#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:03,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {5986#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5979#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:03,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {5986#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5986#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:03,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5986#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:03,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {5993#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5993#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:03,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {6000#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5993#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:03,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {6000#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6000#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:03,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6000#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:03,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {6007#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6007#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:03,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6007#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:03,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret6 := main(); {5741#true} is VALID [2022-04-15 05:46:03,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #39#return; {5741#true} is VALID [2022-04-15 05:46:03,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2022-04-15 05:46:03,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {5741#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(12, 2);call #Ultimate.allocInit(12, 3); {5741#true} is VALID [2022-04-15 05:46:03,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5741#true} is VALID [2022-04-15 05:46:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:03,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869168965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:03,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:03,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 05:46:03,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1375533822] [2022-04-15 05:46:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1375533822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:03,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:03,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:46:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313181355] [2022-04-15 05:46:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 05:46:03,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:03,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:03,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:03,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:46:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:46:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:46:03,825 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:04,170 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 05:46:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:46:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 05:46:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-15 05:46:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-15 05:46:04,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2022-04-15 05:46:04,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:04,208 INFO L225 Difference]: With dead ends: 52 [2022-04-15 05:46:04,208 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 05:46:04,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:46:04,210 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:04,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 39 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 05:46:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 05:46:04,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:04,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,275 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,275 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:04,275 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 05:46:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 05:46:04,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:04,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:04,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 05:46:04,276 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 05:46:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:04,277 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 05:46:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 05:46:04,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:04,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:04,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:04,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 05:46:04,278 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2022-04-15 05:46:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:04,278 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 05:46:04,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:04,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 05:46:04,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 05:46:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 05:46:04,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:04,325 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:04,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:04,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 05:46:04,526 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1573061530, now seen corresponding path program 31 times [2022-04-15 05:46:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:04,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045718330] [2022-04-15 05:46:04,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:04,529 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:04,529 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1573061530, now seen corresponding path program 32 times [2022-04-15 05:46:04,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:04,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685750142] [2022-04-15 05:46:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:04,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:04,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {6371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-15 05:46:04,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-15 05:46:04,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-15 05:46:04,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:04,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {6371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-15 05:46:04,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-15 05:46:04,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-15 05:46:04,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret6 := main(); {6349#true} is VALID [2022-04-15 05:46:04,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6354#(= main_~i~0 0)} is VALID [2022-04-15 05:46:04,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {6354#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6354#(= main_~i~0 0)} is VALID [2022-04-15 05:46:04,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {6354#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6355#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:04,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6355#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:04,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {6355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6356#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:04,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {6356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6356#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:04,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {6356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6357#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:04,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {6357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6357#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:04,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {6357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6358#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:04,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {6358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6358#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:04,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {6358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6359#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:04,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {6359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6359#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:04,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {6359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6360#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:04,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {6360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6360#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:04,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {6360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6361#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:04,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {6361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6361#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:04,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {6361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6362#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:04,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {6362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6362#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:04,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {6362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6363#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:04,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {6363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6363#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:04,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {6363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6364#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:04,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {6364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6364#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:04,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {6364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6365#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:04,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {6365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6365#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:04,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {6365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6366#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:04,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {6366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6366#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:04,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {6366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6367#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:04,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {6367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6367#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:04,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {6367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6368#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:04,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {6368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6368#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:04,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {6368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6369#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:04,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {6369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6369#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:04,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {6369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6370#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:04,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {6370#(<= main_~i~0 16)} assume !(~i~0 < 1024); {6350#false} is VALID [2022-04-15 05:46:04,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6350#false} is VALID [2022-04-15 05:46:04,787 INFO L272 TraceCheckUtils]: 40: Hoare triple {6350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6350#false} is VALID [2022-04-15 05:46:04,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#false} ~cond := #in~cond; {6350#false} is VALID [2022-04-15 05:46:04,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#false} assume 0 == ~cond; {6350#false} is VALID [2022-04-15 05:46:04,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-15 05:46:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:04,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:04,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685750142] [2022-04-15 05:46:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685750142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:04,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737235806] [2022-04-15 05:46:04,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:46:04,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:04,789 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:04,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 05:46:04,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:46:04,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:04,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:46:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:04,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:05,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6349#true} is VALID [2022-04-15 05:46:05,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#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(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-15 05:46:05,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-15 05:46:05,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-15 05:46:05,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret6 := main(); {6349#true} is VALID [2022-04-15 05:46:05,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6390#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:05,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {6390#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6390#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:05,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {6390#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6355#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:05,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6355#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:05,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {6355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6356#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:05,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {6356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6356#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:05,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {6356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6357#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:05,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {6357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6357#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:05,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {6357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6358#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:05,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {6358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6358#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:05,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {6358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6359#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:05,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {6359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6359#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:05,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {6359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6360#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:05,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {6360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6360#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:05,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {6360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6361#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:05,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {6361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6361#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:05,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {6361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6362#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:05,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {6362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6362#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:05,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {6362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6363#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:05,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {6363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6363#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:05,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {6363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6364#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:05,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {6364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6364#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:05,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {6364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6365#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:05,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {6365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6365#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:05,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {6365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6366#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:05,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {6366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6366#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:05,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {6366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6367#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:05,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {6367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6367#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:05,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {6367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6368#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:05,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {6368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6368#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:05,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {6368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6369#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:05,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {6369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6369#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:05,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {6369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6370#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:05,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {6370#(<= main_~i~0 16)} assume !(~i~0 < 1024); {6350#false} is VALID [2022-04-15 05:46:05,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6350#false} is VALID [2022-04-15 05:46:05,139 INFO L272 TraceCheckUtils]: 40: Hoare triple {6350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6350#false} is VALID [2022-04-15 05:46:05,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#false} ~cond := #in~cond; {6350#false} is VALID [2022-04-15 05:46:05,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#false} assume 0 == ~cond; {6350#false} is VALID [2022-04-15 05:46:05,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-15 05:46:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:05,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:05,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#false} assume !false; {6350#false} is VALID [2022-04-15 05:46:05,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#false} assume 0 == ~cond; {6350#false} is VALID [2022-04-15 05:46:05,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#false} ~cond := #in~cond; {6350#false} is VALID [2022-04-15 05:46:05,671 INFO L272 TraceCheckUtils]: 40: Hoare triple {6350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6350#false} is VALID [2022-04-15 05:46:05,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6350#false} is VALID [2022-04-15 05:46:05,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {6520#(< main_~i~0 1024)} assume !(~i~0 < 1024); {6350#false} is VALID [2022-04-15 05:46:05,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {6524#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6520#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:05,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {6524#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6524#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:05,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {6531#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6524#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:05,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {6531#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6531#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:05,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {6538#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6531#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:05,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {6538#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6538#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:05,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {6545#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6538#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:05,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {6545#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6545#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:05,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {6552#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6545#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:05,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {6552#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6552#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:05,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {6559#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6552#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:05,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {6559#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6559#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:05,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {6566#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6559#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:05,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {6566#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6566#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:05,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {6573#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6566#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:05,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {6573#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6573#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:05,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {6580#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6573#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:05,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {6580#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6580#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:05,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {6587#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6580#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:05,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6587#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:05,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {6594#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6587#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:05,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {6594#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6594#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:05,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {6601#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6594#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:05,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {6601#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6601#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:05,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {6608#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6601#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:05,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {6608#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6608#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:05,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {6615#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6608#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:05,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {6615#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6615#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:05,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {6622#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:05,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {6622#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6622#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:05,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {6629#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6622#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:05,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {6629#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6629#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:05,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {6349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6629#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:05,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {6349#true} call #t~ret6 := main(); {6349#true} is VALID [2022-04-15 05:46:05,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6349#true} {6349#true} #39#return; {6349#true} is VALID [2022-04-15 05:46:05,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {6349#true} assume true; {6349#true} is VALID [2022-04-15 05:46:05,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {6349#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(12, 2);call #Ultimate.allocInit(12, 3); {6349#true} is VALID [2022-04-15 05:46:05,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {6349#true} call ULTIMATE.init(); {6349#true} is VALID [2022-04-15 05:46:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:05,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737235806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:05,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:05,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 05:46:05,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:05,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045718330] [2022-04-15 05:46:05,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045718330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:05,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:05,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:46:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16843452] [2022-04-15 05:46:05,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 05:46:05,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:05,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:05,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:05,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:46:05,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:46:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 05:46:05,737 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:06,116 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 05:46:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:46:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 05:46:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-15 05:46:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-15 05:46:06,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 54 transitions. [2022-04-15 05:46:06,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:06,161 INFO L225 Difference]: With dead ends: 54 [2022-04-15 05:46:06,161 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 05:46:06,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 05:46:06,163 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:06,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 19 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:46:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 05:46:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-15 05:46:06,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:06,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,260 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,260 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:06,261 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 05:46:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 05:46:06,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:06,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:06,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 05:46:06,262 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 05:46:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:06,262 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 05:46:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 05:46:06,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:06,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:06,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:06,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 05:46:06,263 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2022-04-15 05:46:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:06,263 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 05:46:06,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:06,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 05:46:06,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 05:46:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 05:46:06,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:06,302 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:06,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 05:46:06,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 05:46:06,503 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash -990445412, now seen corresponding path program 33 times [2022-04-15 05:46:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:06,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676066937] [2022-04-15 05:46:06,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:06,506 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:06,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -990445412, now seen corresponding path program 34 times [2022-04-15 05:46:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:06,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207224164] [2022-04-15 05:46:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:06,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {7008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-15 05:46:06,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-15 05:46:06,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-15 05:46:06,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {7008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:06,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {7008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-15 05:46:06,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-15 05:46:06,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-15 05:46:06,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2022-04-15 05:46:06,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {6990#(= main_~i~0 0)} is VALID [2022-04-15 05:46:06,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {6990#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6990#(= main_~i~0 0)} is VALID [2022-04-15 05:46:06,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {6990#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6991#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:06,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {6991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6991#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:06,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6992#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:06,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {6992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6992#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:06,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {6992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6993#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:06,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {6993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6993#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:06,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {6993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6994#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:06,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {6994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6994#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:06,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {6994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6995#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:06,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {6995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6995#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:06,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {6995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6996#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:06,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {6996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6996#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:06,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {6996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6997#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:06,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {6997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6997#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:06,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {6997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6998#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:06,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {6998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6998#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:06,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {6998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6999#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:06,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {6999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6999#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:06,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {6999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7000#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:06,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {7000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7000#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:06,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {7000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:06,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {7001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7001#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:06,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {7001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7002#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:06,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7002#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:06,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7003#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:06,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {7003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7003#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:06,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {7003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7004#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:06,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {7004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7004#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:06,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {7004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7005#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:06,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {7005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7005#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:06,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {7005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7006#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:06,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {7006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7006#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:06,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {7006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7007#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:06,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {7007#(<= main_~i~0 17)} assume !(~i~0 < 1024); {6986#false} is VALID [2022-04-15 05:46:06,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {6986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6986#false} is VALID [2022-04-15 05:46:06,760 INFO L272 TraceCheckUtils]: 42: Hoare triple {6986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6986#false} is VALID [2022-04-15 05:46:06,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2022-04-15 05:46:06,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {6986#false} assume 0 == ~cond; {6986#false} is VALID [2022-04-15 05:46:06,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2022-04-15 05:46:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:06,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207224164] [2022-04-15 05:46:06,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207224164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:06,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284092727] [2022-04-15 05:46:06,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:46:06,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:06,762 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:06,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 05:46:06,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:46:06,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:06,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 05:46:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:07,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {6985#true} is VALID [2022-04-15 05:46:07,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {6985#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(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-15 05:46:07,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-15 05:46:07,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-15 05:46:07,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2022-04-15 05:46:07,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7027#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:07,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {7027#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7027#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:07,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {7027#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6991#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:07,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {6991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6991#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:07,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {6991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6992#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:07,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {6992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6992#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:07,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {6992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6993#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:07,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {6993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6993#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:07,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {6993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6994#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:07,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {6994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6994#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:07,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {6994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6995#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:07,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {6995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6995#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:07,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {6995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6996#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:07,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {6996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6996#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:07,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {6996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6997#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:07,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {6997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6997#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:07,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {6997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6998#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:07,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {6998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6998#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:07,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {6998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6999#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:07,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {6999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6999#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:07,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {6999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7000#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:07,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {7000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7000#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:07,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {7000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:07,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {7001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7001#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:07,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {7001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7002#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:07,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {7002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7002#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:07,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {7002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7003#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:07,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {7003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7003#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:07,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {7003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7004#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:07,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {7004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7004#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:07,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {7004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7005#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:07,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {7005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7005#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:07,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {7005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7006#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:07,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {7006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7006#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:07,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {7006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7007#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:07,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {7007#(<= main_~i~0 17)} assume !(~i~0 < 1024); {6986#false} is VALID [2022-04-15 05:46:07,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {6986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6986#false} is VALID [2022-04-15 05:46:07,106 INFO L272 TraceCheckUtils]: 42: Hoare triple {6986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6986#false} is VALID [2022-04-15 05:46:07,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2022-04-15 05:46:07,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {6986#false} assume 0 == ~cond; {6986#false} is VALID [2022-04-15 05:46:07,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2022-04-15 05:46:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:07,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:07,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2022-04-15 05:46:07,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {6986#false} assume 0 == ~cond; {6986#false} is VALID [2022-04-15 05:46:07,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2022-04-15 05:46:07,711 INFO L272 TraceCheckUtils]: 42: Hoare triple {6986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {6986#false} is VALID [2022-04-15 05:46:07,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {6986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6986#false} is VALID [2022-04-15 05:46:07,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {7163#(< main_~i~0 1024)} assume !(~i~0 < 1024); {6986#false} is VALID [2022-04-15 05:46:07,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {7167#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7163#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:07,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {7167#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7167#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:07,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {7174#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7167#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:07,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {7174#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7174#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:07,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {7181#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7174#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:07,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {7181#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7181#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:07,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7181#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:07,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7188#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:07,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {7195#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7188#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:07,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {7195#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7195#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:07,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {7202#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7195#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:07,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {7202#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7202#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:07,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {7209#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7202#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:07,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {7209#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7209#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:07,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {7216#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7209#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:07,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {7216#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7216#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:07,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {7223#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7216#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:07,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {7223#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7223#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:07,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {7230#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7223#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:07,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {7230#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7230#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:07,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {7237#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7230#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:07,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {7237#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7237#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:07,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {7244#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7237#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:07,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {7244#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7244#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:07,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {7251#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7244#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:07,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {7251#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7251#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:07,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {7258#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7251#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:07,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {7258#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7258#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:07,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {7265#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7258#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:07,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {7265#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7265#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:07,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {7272#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7265#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:07,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {7272#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7272#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:07,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {7279#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7272#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:07,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {7279#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7279#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:07,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7279#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:07,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2022-04-15 05:46:07,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #39#return; {6985#true} is VALID [2022-04-15 05:46:07,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2022-04-15 05:46:07,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {6985#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(12, 2);call #Ultimate.allocInit(12, 3); {6985#true} is VALID [2022-04-15 05:46:07,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {6985#true} is VALID [2022-04-15 05:46:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:07,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284092727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:07,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:07,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 05:46:07,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676066937] [2022-04-15 05:46:07,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676066937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:07,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:07,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:46:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812416444] [2022-04-15 05:46:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 05:46:07,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:07,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:07,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:07,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:46:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:46:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:46:07,778 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:08,210 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 05:46:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:46:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 05:46:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-15 05:46:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-15 05:46:08,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2022-04-15 05:46:08,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:08,253 INFO L225 Difference]: With dead ends: 56 [2022-04-15 05:46:08,253 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 05:46:08,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 05:46:08,255 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:08,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 05:46:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 05:46:08,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:08,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,327 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,327 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:08,328 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 05:46:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 05:46:08,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:08,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:08,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 05:46:08,328 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 05:46:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:08,329 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 05:46:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 05:46:08,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:08,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:08,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:08,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 05:46:08,330 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2022-04-15 05:46:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:08,330 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 05:46:08,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:08,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 05:46:08,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 05:46:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 05:46:08,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:08,371 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:08,386 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-15 05:46:08,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 05:46:08,575 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:08,576 INFO L85 PathProgramCache]: Analyzing trace with hash 790611230, now seen corresponding path program 35 times [2022-04-15 05:46:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:08,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351095555] [2022-04-15 05:46:08,578 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:08,578 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:08,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash 790611230, now seen corresponding path program 36 times [2022-04-15 05:46:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:08,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301852914] [2022-04-15 05:46:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:08,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {7673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-15 05:46:08,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-15 05:46:08,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-15 05:46:08,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {7649#true} call ULTIMATE.init(); {7673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:08,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {7673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-15 05:46:08,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-15 05:46:08,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-15 05:46:08,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {7649#true} call #t~ret6 := main(); {7649#true} is VALID [2022-04-15 05:46:08,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {7649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7654#(= main_~i~0 0)} is VALID [2022-04-15 05:46:08,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7654#(= main_~i~0 0)} is VALID [2022-04-15 05:46:08,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7655#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:08,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {7655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7655#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:08,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {7655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7656#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:08,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {7656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7656#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:08,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {7656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7657#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:08,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {7657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7657#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:08,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {7657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7658#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:08,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {7658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7658#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:08,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {7658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7659#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:08,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {7659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7659#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:08,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7660#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:08,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7660#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:08,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7661#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:08,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {7661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7661#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:08,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {7661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7662#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:08,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {7662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7662#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:08,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {7662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7663#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:08,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {7663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7663#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:08,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {7663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7664#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:08,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {7664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7664#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:08,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {7664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7665#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:08,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {7665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7665#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:08,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {7665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7666#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:08,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {7666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7666#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:08,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {7666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7667#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:08,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {7667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7667#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:08,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {7667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7668#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:08,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {7668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7668#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:08,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {7668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7669#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:08,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {7669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7669#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:08,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {7669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:08,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {7670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7670#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:08,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {7670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7671#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:08,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {7671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7671#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:08,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {7671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7672#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:08,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {7672#(<= main_~i~0 18)} assume !(~i~0 < 1024); {7650#false} is VALID [2022-04-15 05:46:08,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {7650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7650#false} is VALID [2022-04-15 05:46:08,826 INFO L272 TraceCheckUtils]: 44: Hoare triple {7650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {7650#false} is VALID [2022-04-15 05:46:08,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {7650#false} ~cond := #in~cond; {7650#false} is VALID [2022-04-15 05:46:08,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {7650#false} assume 0 == ~cond; {7650#false} is VALID [2022-04-15 05:46:08,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {7650#false} assume !false; {7650#false} is VALID [2022-04-15 05:46:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:08,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301852914] [2022-04-15 05:46:08,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301852914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:08,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795579368] [2022-04-15 05:46:08,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:46:08,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:08,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:08,828 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:08,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 05:46:09,159 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 05:46:09,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:09,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 05:46:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:09,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:09,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {7649#true} call ULTIMATE.init(); {7649#true} is VALID [2022-04-15 05:46:09,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {7649#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(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-15 05:46:09,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-15 05:46:09,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-15 05:46:09,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {7649#true} call #t~ret6 := main(); {7649#true} is VALID [2022-04-15 05:46:09,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {7649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7692#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:09,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {7692#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7692#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:09,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {7692#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7655#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:09,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {7655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7655#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:09,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {7655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7656#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:09,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {7656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7656#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:09,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {7656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7657#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:09,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {7657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7657#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:09,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {7657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7658#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:09,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {7658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7658#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:09,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {7658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7659#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:09,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {7659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7659#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:09,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7660#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:09,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7660#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:09,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7661#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:09,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {7661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7661#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:09,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {7661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7662#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:09,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {7662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7662#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:09,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {7662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7663#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:09,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {7663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7663#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:09,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {7663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7664#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:09,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {7664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7664#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:09,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {7664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7665#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:09,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {7665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7665#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:09,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {7665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7666#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:09,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {7666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7666#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:09,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {7666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7667#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:09,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {7667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7667#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:09,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {7667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7668#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:09,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {7668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7668#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:09,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {7668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7669#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:09,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {7669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7669#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:09,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {7669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:09,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {7670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7670#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:09,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {7670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7671#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:09,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {7671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7671#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:09,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {7671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7672#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:09,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {7672#(<= main_~i~0 18)} assume !(~i~0 < 1024); {7650#false} is VALID [2022-04-15 05:46:09,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {7650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7650#false} is VALID [2022-04-15 05:46:09,449 INFO L272 TraceCheckUtils]: 44: Hoare triple {7650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {7650#false} is VALID [2022-04-15 05:46:09,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {7650#false} ~cond := #in~cond; {7650#false} is VALID [2022-04-15 05:46:09,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {7650#false} assume 0 == ~cond; {7650#false} is VALID [2022-04-15 05:46:09,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {7650#false} assume !false; {7650#false} is VALID [2022-04-15 05:46:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:09,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:10,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {7650#false} assume !false; {7650#false} is VALID [2022-04-15 05:46:10,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {7650#false} assume 0 == ~cond; {7650#false} is VALID [2022-04-15 05:46:10,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {7650#false} ~cond := #in~cond; {7650#false} is VALID [2022-04-15 05:46:10,060 INFO L272 TraceCheckUtils]: 44: Hoare triple {7650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {7650#false} is VALID [2022-04-15 05:46:10,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {7650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7650#false} is VALID [2022-04-15 05:46:10,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {7834#(< main_~i~0 1024)} assume !(~i~0 < 1024); {7650#false} is VALID [2022-04-15 05:46:10,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {7838#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7834#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:10,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {7838#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7838#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:10,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {7845#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7838#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:10,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {7845#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7845#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:10,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {7852#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7845#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:10,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {7852#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7852#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:10,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {7859#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7852#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:10,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {7859#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7859#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:10,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {7866#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7859#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:10,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {7866#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7866#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:10,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {7873#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7866#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:10,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {7873#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7873#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:10,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {7880#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7873#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:10,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {7880#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7880#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:10,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {7887#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7880#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:10,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {7887#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7887#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:10,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {7894#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7887#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:10,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {7894#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7894#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:10,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {7901#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7894#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:10,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {7901#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7901#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:10,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {7908#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7901#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:10,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {7908#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7908#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:10,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {7915#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7908#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:10,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {7915#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7915#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:10,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {7922#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7915#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:10,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {7922#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7922#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:10,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {7929#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7922#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:10,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {7929#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7929#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:10,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {7936#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7929#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:10,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {7936#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7936#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:10,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {7943#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7936#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:10,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {7943#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7943#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:10,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {7950#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7943#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:10,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {7950#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7950#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:10,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {7957#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7950#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:10,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {7957#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7957#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:10,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {7649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {7957#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:10,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {7649#true} call #t~ret6 := main(); {7649#true} is VALID [2022-04-15 05:46:10,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7649#true} {7649#true} #39#return; {7649#true} is VALID [2022-04-15 05:46:10,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {7649#true} assume true; {7649#true} is VALID [2022-04-15 05:46:10,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {7649#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(12, 2);call #Ultimate.allocInit(12, 3); {7649#true} is VALID [2022-04-15 05:46:10,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {7649#true} call ULTIMATE.init(); {7649#true} is VALID [2022-04-15 05:46:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:10,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795579368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:10,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:10,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 05:46:10,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351095555] [2022-04-15 05:46:10,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351095555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:10,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:10,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 05:46:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063954631] [2022-04-15 05:46:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 05:46:10,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:10,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:10,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 05:46:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 05:46:10,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:46:10,106 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:10,525 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 05:46:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:46:10,526 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 05:46:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-15 05:46:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-15 05:46:10,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-15 05:46:10,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:10,579 INFO L225 Difference]: With dead ends: 58 [2022-04-15 05:46:10,579 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 05:46:10,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 05:46:10,581 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:10,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 39 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 05:46:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-15 05:46:10,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:10,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,678 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,678 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:10,679 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 05:46:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 05:46:10,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:10,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:10,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 05:46:10,679 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 05:46:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:10,680 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 05:46:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 05:46:10,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:10,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:10,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:10,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 05:46:10,682 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2022-04-15 05:46:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:10,682 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 05:46:10,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:10,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 05:46:10,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 05:46:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 05:46:10,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:10,730 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:10,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:10,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:10,930 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1305906912, now seen corresponding path program 37 times [2022-04-15 05:46:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:10,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543013859] [2022-04-15 05:46:10,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:10,933 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:10,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1305906912, now seen corresponding path program 38 times [2022-04-15 05:46:10,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:10,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448302333] [2022-04-15 05:46:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:11,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {8366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-15 05:46:11,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-15 05:46:11,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-15 05:46:11,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} call ULTIMATE.init(); {8366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:11,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {8366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-15 05:46:11,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-15 05:46:11,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-15 05:46:11,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} call #t~ret6 := main(); {8341#true} is VALID [2022-04-15 05:46:11,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {8346#(= main_~i~0 0)} is VALID [2022-04-15 05:46:11,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {8346#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8346#(= main_~i~0 0)} is VALID [2022-04-15 05:46:11,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {8346#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8347#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:11,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {8347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:11,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8348#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:11,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {8348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:11,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {8348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8349#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:11,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {8349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:11,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {8349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8350#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:11,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {8350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:11,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {8350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8351#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:11,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {8351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:11,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {8351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8352#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:11,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:11,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8353#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:11,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {8353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:11,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {8353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8354#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:11,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {8354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:11,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {8354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8355#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:11,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {8355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:11,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {8355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8356#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:11,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {8356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:11,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {8356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8357#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:11,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {8357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:11,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {8357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8358#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:11,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {8358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:11,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {8358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8359#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:11,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {8359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:11,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {8359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8360#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:11,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {8360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:11,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {8360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8361#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:11,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {8361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:11,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {8361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8362#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:11,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:11,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8363#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:11,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {8363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8363#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:11,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {8363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8364#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:11,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {8364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8364#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:11,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {8364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8365#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:11,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {8365#(<= main_~i~0 19)} assume !(~i~0 < 1024); {8342#false} is VALID [2022-04-15 05:46:11,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {8342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8342#false} is VALID [2022-04-15 05:46:11,207 INFO L272 TraceCheckUtils]: 46: Hoare triple {8342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {8342#false} is VALID [2022-04-15 05:46:11,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {8342#false} ~cond := #in~cond; {8342#false} is VALID [2022-04-15 05:46:11,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {8342#false} assume 0 == ~cond; {8342#false} is VALID [2022-04-15 05:46:11,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {8342#false} assume !false; {8342#false} is VALID [2022-04-15 05:46:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448302333] [2022-04-15 05:46:11,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448302333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470613617] [2022-04-15 05:46:11,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:46:11,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:11,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:11,209 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:11,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 05:46:11,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:46:11,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:11,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:46:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:11,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:11,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} call ULTIMATE.init(); {8341#true} is VALID [2022-04-15 05:46:11,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#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(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-15 05:46:11,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-15 05:46:11,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-15 05:46:11,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} call #t~ret6 := main(); {8341#true} is VALID [2022-04-15 05:46:11,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {8385#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:11,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {8385#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8385#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:11,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {8385#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8347#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:11,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {8347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:11,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8348#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:11,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {8348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:11,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {8348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8349#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:11,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {8349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:11,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {8349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8350#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:11,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {8350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:11,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {8350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8351#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:11,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {8351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:11,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {8351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8352#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:11,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:11,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8353#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:11,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {8353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:11,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {8353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8354#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:11,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {8354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:11,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {8354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8355#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:11,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {8355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:11,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {8355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8356#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:11,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {8356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:11,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {8356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8357#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:11,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {8357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:11,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {8357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8358#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:11,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {8358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:11,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {8358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8359#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:11,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {8359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:11,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {8359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8360#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:11,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {8360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:11,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {8360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8361#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:11,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {8361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:11,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {8361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8362#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:11,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:11,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8363#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:11,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {8363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8363#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:11,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {8363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8364#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:11,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {8364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8364#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:11,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {8364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8365#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:11,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {8365#(<= main_~i~0 19)} assume !(~i~0 < 1024); {8342#false} is VALID [2022-04-15 05:46:11,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {8342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8342#false} is VALID [2022-04-15 05:46:11,622 INFO L272 TraceCheckUtils]: 46: Hoare triple {8342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {8342#false} is VALID [2022-04-15 05:46:11,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {8342#false} ~cond := #in~cond; {8342#false} is VALID [2022-04-15 05:46:11,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {8342#false} assume 0 == ~cond; {8342#false} is VALID [2022-04-15 05:46:11,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {8342#false} assume !false; {8342#false} is VALID [2022-04-15 05:46:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:11,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:12,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {8342#false} assume !false; {8342#false} is VALID [2022-04-15 05:46:12,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {8342#false} assume 0 == ~cond; {8342#false} is VALID [2022-04-15 05:46:12,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {8342#false} ~cond := #in~cond; {8342#false} is VALID [2022-04-15 05:46:12,362 INFO L272 TraceCheckUtils]: 46: Hoare triple {8342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {8342#false} is VALID [2022-04-15 05:46:12,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {8342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8342#false} is VALID [2022-04-15 05:46:12,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#(< main_~i~0 1024)} assume !(~i~0 < 1024); {8342#false} is VALID [2022-04-15 05:46:12,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {8537#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8533#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:12,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {8537#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8537#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:12,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {8544#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8537#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:12,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {8544#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8544#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:12,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {8551#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8544#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:12,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {8551#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8551#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:12,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {8558#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8551#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:12,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {8558#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8558#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:12,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {8565#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8558#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:12,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {8565#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8565#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:12,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {8572#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8565#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:12,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {8572#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8572#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:12,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {8579#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8572#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:12,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {8579#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8579#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:12,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {8586#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8579#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:12,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {8586#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8586#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:12,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {8593#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8586#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:12,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {8593#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8593#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:12,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {8600#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8593#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:12,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {8600#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8600#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:12,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {8607#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8600#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:12,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {8607#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8607#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:12,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {8614#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8607#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:12,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {8614#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8614#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:12,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {8621#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8614#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:12,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {8621#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8621#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:12,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {8628#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8621#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:12,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {8628#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8628#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:12,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {8635#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8628#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:12,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {8635#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8635#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:12,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {8642#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8635#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:12,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {8642#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8642#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:12,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {8649#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8642#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:12,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {8649#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8649#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:12,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {8656#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8649#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:12,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {8656#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8656#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:12,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {8663#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8656#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:12,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {8663#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8663#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:12,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {8663#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:12,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} call #t~ret6 := main(); {8341#true} is VALID [2022-04-15 05:46:12,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} #39#return; {8341#true} is VALID [2022-04-15 05:46:12,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} assume true; {8341#true} is VALID [2022-04-15 05:46:12,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#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(12, 2);call #Ultimate.allocInit(12, 3); {8341#true} is VALID [2022-04-15 05:46:12,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} call ULTIMATE.init(); {8341#true} is VALID [2022-04-15 05:46:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:12,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470613617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:12,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:12,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 05:46:12,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:12,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543013859] [2022-04-15 05:46:12,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543013859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:12,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:12,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:46:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912294837] [2022-04-15 05:46:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 05:46:12,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:12,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:12,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:12,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:46:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:46:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 05:46:12,410 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:12,870 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 05:46:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 05:46:12,871 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 05:46:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-15 05:46:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-15 05:46:12,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-15 05:46:12,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:12,930 INFO L225 Difference]: With dead ends: 60 [2022-04-15 05:46:12,930 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 05:46:12,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 05:46:12,932 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:12,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 05:46:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-15 05:46:13,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:13,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:13,023 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:13,024 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:13,025 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 05:46:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 05:46:13,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:13,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:13,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 05:46:13,025 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 05:46:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:13,026 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 05:46:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 05:46:13,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:13,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:13,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:13,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-15 05:46:13,028 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2022-04-15 05:46:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:13,028 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-15 05:46:13,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:13,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-15 05:46:13,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 05:46:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 05:46:13,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:13,089 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:13,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:13,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:13,295 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1720179550, now seen corresponding path program 39 times [2022-04-15 05:46:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:13,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811927281] [2022-04-15 05:46:13,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:13,298 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:13,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1720179550, now seen corresponding path program 40 times [2022-04-15 05:46:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:13,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451316059] [2022-04-15 05:46:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:13,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {9087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-15 05:46:13,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-15 05:46:13,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-15 05:46:13,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {9061#true} call ULTIMATE.init(); {9087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:13,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {9087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-15 05:46:13,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-15 05:46:13,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-15 05:46:13,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {9061#true} call #t~ret6 := main(); {9061#true} is VALID [2022-04-15 05:46:13,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {9061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9066#(= main_~i~0 0)} is VALID [2022-04-15 05:46:13,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9066#(= main_~i~0 0)} is VALID [2022-04-15 05:46:13,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {9066#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9067#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:13,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {9067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9067#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:13,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {9067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9068#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:13,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {9068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9068#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:13,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {9068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9069#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:13,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {9069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9069#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:13,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {9069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9070#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:13,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {9070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9070#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:13,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {9070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9071#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:13,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {9071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9071#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:13,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {9071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9072#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:13,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9072#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:13,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9073#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:13,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {9073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9073#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:13,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {9073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9074#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:13,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {9074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9074#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:13,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {9074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9075#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:13,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {9075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9075#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:13,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {9075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9076#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:13,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {9076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9076#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:13,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {9076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9077#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:13,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9077#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:13,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {9077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9078#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:13,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {9078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9078#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:13,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {9078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9079#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:13,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9079#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:13,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {9079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9080#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:13,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {9080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9080#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:13,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {9080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9081#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:13,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {9081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9081#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:13,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {9081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9082#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:13,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {9082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9082#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:13,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {9082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9083#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:13,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {9083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9083#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:13,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {9083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9084#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:13,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {9084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9084#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:13,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {9084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9085#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:13,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {9085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9085#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:13,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {9085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9086#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:13,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {9086#(<= main_~i~0 20)} assume !(~i~0 < 1024); {9062#false} is VALID [2022-04-15 05:46:13,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9062#false} is VALID [2022-04-15 05:46:13,566 INFO L272 TraceCheckUtils]: 48: Hoare triple {9062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9062#false} is VALID [2022-04-15 05:46:13,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {9062#false} ~cond := #in~cond; {9062#false} is VALID [2022-04-15 05:46:13,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {9062#false} assume 0 == ~cond; {9062#false} is VALID [2022-04-15 05:46:13,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {9062#false} assume !false; {9062#false} is VALID [2022-04-15 05:46:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451316059] [2022-04-15 05:46:13,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451316059] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491886180] [2022-04-15 05:46:13,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:46:13,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:13,568 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:13,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 05:46:13,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:46:13,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:13,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 05:46:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:13,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:13,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {9061#true} call ULTIMATE.init(); {9061#true} is VALID [2022-04-15 05:46:13,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {9061#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(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-15 05:46:13,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-15 05:46:13,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-15 05:46:13,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {9061#true} call #t~ret6 := main(); {9061#true} is VALID [2022-04-15 05:46:13,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {9061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9106#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:13,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {9106#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9106#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:13,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {9106#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9067#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:13,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {9067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9067#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:13,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {9067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9068#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:13,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {9068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9068#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:13,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {9068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9069#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:13,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {9069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9069#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:13,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {9069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9070#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:13,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {9070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9070#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:13,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {9070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9071#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:13,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {9071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9071#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:13,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {9071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9072#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:13,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9072#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:13,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9073#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:13,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {9073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9073#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:13,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {9073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9074#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:13,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {9074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9074#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:13,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {9074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9075#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:13,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {9075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9075#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:13,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {9075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9076#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:13,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {9076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9076#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:13,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {9076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9077#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:13,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9077#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:13,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {9077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9078#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:13,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {9078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9078#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:13,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {9078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9079#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:13,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9079#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:13,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {9079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9080#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:13,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {9080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9080#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:13,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {9080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9081#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:13,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {9081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9081#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:13,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {9081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9082#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:13,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {9082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9082#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:13,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {9082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9083#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:13,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {9083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9083#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:13,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {9083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9084#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:13,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {9084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9084#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:13,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {9084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9085#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:13,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {9085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9085#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:13,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {9085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9086#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:13,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {9086#(<= main_~i~0 20)} assume !(~i~0 < 1024); {9062#false} is VALID [2022-04-15 05:46:13,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9062#false} is VALID [2022-04-15 05:46:13,995 INFO L272 TraceCheckUtils]: 48: Hoare triple {9062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9062#false} is VALID [2022-04-15 05:46:13,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {9062#false} ~cond := #in~cond; {9062#false} is VALID [2022-04-15 05:46:13,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {9062#false} assume 0 == ~cond; {9062#false} is VALID [2022-04-15 05:46:13,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {9062#false} assume !false; {9062#false} is VALID [2022-04-15 05:46:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:13,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:14,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {9062#false} assume !false; {9062#false} is VALID [2022-04-15 05:46:14,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {9062#false} assume 0 == ~cond; {9062#false} is VALID [2022-04-15 05:46:14,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {9062#false} ~cond := #in~cond; {9062#false} is VALID [2022-04-15 05:46:14,734 INFO L272 TraceCheckUtils]: 48: Hoare triple {9062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9062#false} is VALID [2022-04-15 05:46:14,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9062#false} is VALID [2022-04-15 05:46:14,737 INFO L290 TraceCheckUtils]: 46: Hoare triple {9260#(< main_~i~0 1024)} assume !(~i~0 < 1024); {9062#false} is VALID [2022-04-15 05:46:14,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {9264#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9260#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:14,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {9264#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9264#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:14,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {9271#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9264#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:14,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {9271#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9271#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:14,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {9278#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9271#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:14,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {9278#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9278#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:14,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {9285#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9278#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:14,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {9285#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9285#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:14,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {9292#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9285#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:14,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {9292#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9292#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:14,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {9299#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9292#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:14,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {9299#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9299#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:14,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {9306#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9299#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:14,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {9306#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9306#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:14,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {9313#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9306#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:14,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {9313#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9313#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:14,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {9320#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9313#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:14,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9320#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:14,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {9327#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9320#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:14,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {9327#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9327#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:14,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {9334#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9327#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:14,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {9334#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9334#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:14,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {9341#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9334#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:14,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {9341#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9341#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:14,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {9348#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9341#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:14,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {9348#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9348#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:14,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {9355#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9348#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:14,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {9355#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9355#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:14,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {9362#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9355#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:14,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {9362#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9362#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:14,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {9369#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9362#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:14,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {9369#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9369#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:14,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {9376#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9369#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:14,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {9376#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9376#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:14,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {9383#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9376#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:14,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {9383#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9383#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:14,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {9390#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9383#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:14,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {9390#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9390#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:14,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {9397#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9390#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:14,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {9397#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9397#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:14,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {9061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9397#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:14,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {9061#true} call #t~ret6 := main(); {9061#true} is VALID [2022-04-15 05:46:14,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9061#true} {9061#true} #39#return; {9061#true} is VALID [2022-04-15 05:46:14,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {9061#true} assume true; {9061#true} is VALID [2022-04-15 05:46:14,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {9061#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(12, 2);call #Ultimate.allocInit(12, 3); {9061#true} is VALID [2022-04-15 05:46:14,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {9061#true} call ULTIMATE.init(); {9061#true} is VALID [2022-04-15 05:46:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491886180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:14,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:14,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 05:46:14,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811927281] [2022-04-15 05:46:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811927281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:14,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:14,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 05:46:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821099005] [2022-04-15 05:46:14,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:14,776 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 05:46:14,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:14,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:14,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:14,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 05:46:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 05:46:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:46:14,811 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:15,290 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 05:46:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 05:46:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 05:46:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-15 05:46:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-15 05:46:15,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 62 transitions. [2022-04-15 05:46:15,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:15,339 INFO L225 Difference]: With dead ends: 62 [2022-04-15 05:46:15,339 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 05:46:15,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 05:46:15,341 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:15,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 05:46:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-15 05:46:15,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:15,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,444 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,445 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:15,446 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 05:46:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 05:46:15,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:15,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:15,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 05:46:15,447 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 05:46:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:15,447 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 05:46:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 05:46:15,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:15,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:15,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:15,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 05:46:15,449 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2022-04-15 05:46:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:15,449 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 05:46:15,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:15,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 05:46:15,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 05:46:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 05:46:15,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:15,498 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:15,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 05:46:15,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 05:46:15,698 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -404226140, now seen corresponding path program 41 times [2022-04-15 05:46:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:15,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315362641] [2022-04-15 05:46:15,700 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:15,700 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:15,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash -404226140, now seen corresponding path program 42 times [2022-04-15 05:46:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:15,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99686938] [2022-04-15 05:46:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:15,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {9836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-15 05:46:15,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-15 05:46:15,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-15 05:46:15,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {9809#true} call ULTIMATE.init(); {9836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:15,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {9836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-15 05:46:15,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-15 05:46:15,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-15 05:46:15,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {9809#true} call #t~ret6 := main(); {9809#true} is VALID [2022-04-15 05:46:15,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {9809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9814#(= main_~i~0 0)} is VALID [2022-04-15 05:46:15,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {9814#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9814#(= main_~i~0 0)} is VALID [2022-04-15 05:46:15,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {9814#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9815#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:15,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {9815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9815#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:15,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {9815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9816#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:15,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9816#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:15,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {9816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9817#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:15,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {9817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9817#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:15,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {9817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9818#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:15,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {9818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9818#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:15,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {9818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9819#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:15,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {9819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9819#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:15,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {9819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9820#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:15,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {9820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9820#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:15,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {9820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9821#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:15,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9821#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:15,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9822#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:15,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {9822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9822#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:15,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {9822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9823#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:15,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {9823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9823#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:15,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {9823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9824#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:15,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {9824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9824#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:15,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {9824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9825#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:15,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {9825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9825#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:15,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {9825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9826#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:15,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {9826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9826#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:15,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {9826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9827#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:15,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {9827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9827#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:15,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {9827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9828#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:15,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {9828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9828#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:15,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {9828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9829#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:15,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {9829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9829#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:15,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {9829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9830#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:15,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {9830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9830#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:15,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {9830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9831#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:15,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {9831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9831#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:15,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {9831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9832#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:15,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {9832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9832#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:15,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {9832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9833#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:15,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {9833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9833#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:15,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {9833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9834#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:15,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {9834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9834#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:15,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {9834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9835#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:15,973 INFO L290 TraceCheckUtils]: 48: Hoare triple {9835#(<= main_~i~0 21)} assume !(~i~0 < 1024); {9810#false} is VALID [2022-04-15 05:46:15,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {9810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9810#false} is VALID [2022-04-15 05:46:15,974 INFO L272 TraceCheckUtils]: 50: Hoare triple {9810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9810#false} is VALID [2022-04-15 05:46:15,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {9810#false} ~cond := #in~cond; {9810#false} is VALID [2022-04-15 05:46:15,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {9810#false} assume 0 == ~cond; {9810#false} is VALID [2022-04-15 05:46:15,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {9810#false} assume !false; {9810#false} is VALID [2022-04-15 05:46:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:15,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99686938] [2022-04-15 05:46:15,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99686938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:15,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809329990] [2022-04-15 05:46:15,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:46:15,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:15,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:15,979 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:15,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 05:46:16,522 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 05:46:16,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:16,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:46:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:16,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:16,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {9809#true} call ULTIMATE.init(); {9809#true} is VALID [2022-04-15 05:46:16,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#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(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-15 05:46:16,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-15 05:46:16,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-15 05:46:16,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {9809#true} call #t~ret6 := main(); {9809#true} is VALID [2022-04-15 05:46:16,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {9809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {9855#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:16,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {9855#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9855#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:16,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {9855#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9815#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:16,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {9815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9815#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:16,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {9815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9816#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:16,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9816#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:16,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {9816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9817#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:16,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {9817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9817#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:16,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {9817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9818#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:16,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {9818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9818#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:16,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {9818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9819#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:16,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {9819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9819#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:16,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {9819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9820#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:16,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {9820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9820#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:16,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {9820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9821#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:16,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9821#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:16,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9822#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:16,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {9822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9822#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:16,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {9822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9823#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:16,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {9823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9823#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:16,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {9823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9824#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:16,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {9824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9824#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:16,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {9824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9825#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:16,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {9825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9825#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:16,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {9825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9826#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:16,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {9826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9826#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:16,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {9826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9827#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:16,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {9827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9827#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:16,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {9827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9828#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:16,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {9828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9828#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:16,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {9828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9829#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:16,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {9829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9829#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:16,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {9829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9830#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:16,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {9830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9830#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:16,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {9830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9831#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:16,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {9831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9831#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:16,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {9831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9832#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:16,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {9832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9832#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:16,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {9832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9833#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:16,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {9833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9833#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:16,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {9833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9834#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:16,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {9834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9834#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:16,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {9834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9835#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:16,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {9835#(<= main_~i~0 21)} assume !(~i~0 < 1024); {9810#false} is VALID [2022-04-15 05:46:16,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {9810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9810#false} is VALID [2022-04-15 05:46:16,836 INFO L272 TraceCheckUtils]: 50: Hoare triple {9810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9810#false} is VALID [2022-04-15 05:46:16,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {9810#false} ~cond := #in~cond; {9810#false} is VALID [2022-04-15 05:46:16,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {9810#false} assume 0 == ~cond; {9810#false} is VALID [2022-04-15 05:46:16,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {9810#false} assume !false; {9810#false} is VALID [2022-04-15 05:46:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:16,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:17,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {9810#false} assume !false; {9810#false} is VALID [2022-04-15 05:46:17,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {9810#false} assume 0 == ~cond; {9810#false} is VALID [2022-04-15 05:46:17,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {9810#false} ~cond := #in~cond; {9810#false} is VALID [2022-04-15 05:46:17,624 INFO L272 TraceCheckUtils]: 50: Hoare triple {9810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {9810#false} is VALID [2022-04-15 05:46:17,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {9810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9810#false} is VALID [2022-04-15 05:46:17,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {10015#(< main_~i~0 1024)} assume !(~i~0 < 1024); {9810#false} is VALID [2022-04-15 05:46:17,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {10019#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10015#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:17,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {10019#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10019#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:17,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {10026#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10019#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:17,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {10026#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10026#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:17,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {10033#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10026#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:17,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {10033#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10033#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:17,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {10040#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10033#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:17,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {10040#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10040#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:17,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {10047#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10040#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:17,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {10047#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10047#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:17,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {10054#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10047#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:17,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {10054#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10054#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:17,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {10061#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10054#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:17,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {10061#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10061#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:17,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {10068#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10061#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:17,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {10068#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10068#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:17,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {10075#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10068#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:17,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {10075#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10075#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:17,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {10082#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10075#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:17,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {10082#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10082#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:17,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {10089#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10082#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:17,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {10089#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10089#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:17,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {10096#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10089#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:17,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {10096#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10096#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:17,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {10103#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10096#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:17,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {10103#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10103#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:17,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {10110#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10103#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:17,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {10110#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10110#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:17,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {10117#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10110#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:17,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {10117#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10117#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:17,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {10124#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10117#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:17,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10124#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:17,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {10131#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10124#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:17,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {10131#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10131#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:17,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {10138#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10131#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:17,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {10138#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10138#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:17,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10138#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:17,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {10145#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10145#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:17,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {10152#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10145#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:17,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {10152#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10152#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:17,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {10159#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10152#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:17,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {10159#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10159#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:17,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {9809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10159#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:17,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {9809#true} call #t~ret6 := main(); {9809#true} is VALID [2022-04-15 05:46:17,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9809#true} {9809#true} #39#return; {9809#true} is VALID [2022-04-15 05:46:17,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {9809#true} assume true; {9809#true} is VALID [2022-04-15 05:46:17,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#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(12, 2);call #Ultimate.allocInit(12, 3); {9809#true} is VALID [2022-04-15 05:46:17,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {9809#true} call ULTIMATE.init(); {9809#true} is VALID [2022-04-15 05:46:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:17,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809329990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:17,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:17,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 05:46:17,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315362641] [2022-04-15 05:46:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315362641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 05:46:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916140783] [2022-04-15 05:46:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 05:46:17,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:17,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:17,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:17,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 05:46:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 05:46:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:46:17,680 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:18,199 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 05:46:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 05:46:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 05:46:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-15 05:46:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-15 05:46:18,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 64 transitions. [2022-04-15 05:46:18,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:18,247 INFO L225 Difference]: With dead ends: 64 [2022-04-15 05:46:18,247 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 05:46:18,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:46:18,249 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:18,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 39 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 05:46:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-15 05:46:18,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:18,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,358 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,358 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:18,358 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 05:46:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 05:46:18,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:18,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:18,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 05:46:18,359 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 05:46:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:18,360 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 05:46:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 05:46:18,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:18,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:18,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:18,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-15 05:46:18,361 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2022-04-15 05:46:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:18,362 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-15 05:46:18,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:18,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-15 05:46:18,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 05:46:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 05:46:18,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:18,417 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:18,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 05:46:18,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 05:46:18,619 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1506615846, now seen corresponding path program 43 times [2022-04-15 05:46:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444575953] [2022-04-15 05:46:18,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:18,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:18,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1506615846, now seen corresponding path program 44 times [2022-04-15 05:46:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:18,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481141671] [2022-04-15 05:46:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:18,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {10613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-15 05:46:18,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-15 05:46:18,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-15 05:46:18,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:18,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {10613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-15 05:46:18,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-15 05:46:18,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-15 05:46:18,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret6 := main(); {10585#true} is VALID [2022-04-15 05:46:18,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {10585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10590#(= main_~i~0 0)} is VALID [2022-04-15 05:46:18,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {10590#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10590#(= main_~i~0 0)} is VALID [2022-04-15 05:46:18,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {10590#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10591#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:18,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {10591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10591#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:18,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {10591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10592#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:18,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {10592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10592#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:18,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {10592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10593#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:18,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {10593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10593#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:18,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {10593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10594#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:18,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {10594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10594#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:18,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {10594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10595#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:18,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {10595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10595#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:18,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {10595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10596#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:18,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {10596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10596#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:18,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {10596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10597#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:18,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {10597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10597#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:18,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {10597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10598#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:18,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {10598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10598#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:18,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {10598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10599#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:18,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {10599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10599#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:18,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {10599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10600#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:18,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {10600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10600#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:18,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {10600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10601#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:18,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {10601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10601#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:18,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {10601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10602#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:18,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {10602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10602#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:18,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {10602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10603#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:18,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {10603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10603#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:18,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {10603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10604#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:18,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {10604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10604#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:18,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {10604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10605#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:18,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {10605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10605#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:18,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {10605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10606#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:18,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {10606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10606#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:18,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {10606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10607#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:18,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {10607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10607#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:18,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {10607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10608#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:18,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {10608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10608#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:18,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {10608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10609#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:18,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {10609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10609#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:18,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {10609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10610#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:18,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {10610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10610#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:18,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {10610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10611#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:18,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {10611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10611#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:18,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {10611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10612#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:18,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {10612#(<= main_~i~0 22)} assume !(~i~0 < 1024); {10586#false} is VALID [2022-04-15 05:46:18,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {10586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10586#false} is VALID [2022-04-15 05:46:18,907 INFO L272 TraceCheckUtils]: 52: Hoare triple {10586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {10586#false} is VALID [2022-04-15 05:46:18,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {10586#false} ~cond := #in~cond; {10586#false} is VALID [2022-04-15 05:46:18,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {10586#false} assume 0 == ~cond; {10586#false} is VALID [2022-04-15 05:46:18,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2022-04-15 05:46:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481141671] [2022-04-15 05:46:18,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481141671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146888792] [2022-04-15 05:46:18,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:46:18,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:18,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:18,910 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:18,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 05:46:19,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:46:19,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:19,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:46:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:19,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:19,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10585#true} is VALID [2022-04-15 05:46:19,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#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(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-15 05:46:19,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-15 05:46:19,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-15 05:46:19,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret6 := main(); {10585#true} is VALID [2022-04-15 05:46:19,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {10585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10632#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:19,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {10632#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10632#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:19,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {10632#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10591#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:19,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {10591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10591#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:19,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {10591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10592#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:19,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {10592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10592#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:19,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {10592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10593#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:19,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {10593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10593#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:19,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {10593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10594#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:19,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {10594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10594#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:19,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {10594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10595#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:19,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {10595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10595#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:19,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {10595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10596#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:19,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {10596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10596#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:19,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {10596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10597#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:19,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {10597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10597#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:19,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {10597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10598#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:19,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {10598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10598#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:19,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {10598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10599#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:19,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {10599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10599#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:19,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {10599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10600#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:19,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {10600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10600#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:19,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {10600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10601#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:19,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {10601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10601#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:19,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {10601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10602#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:19,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {10602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10602#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:19,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {10602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10603#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:19,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {10603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10603#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:19,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {10603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10604#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:19,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {10604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10604#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:19,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {10604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10605#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:19,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {10605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10605#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:19,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {10605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10606#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:19,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {10606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10606#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:19,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {10606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10607#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:19,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {10607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10607#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:19,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {10607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10608#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:19,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {10608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10608#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:19,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {10608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10609#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:19,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {10609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10609#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:19,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {10609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10610#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:19,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {10610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10610#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:19,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {10610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10611#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:19,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {10611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10611#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:19,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {10611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10612#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:19,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {10612#(<= main_~i~0 22)} assume !(~i~0 < 1024); {10586#false} is VALID [2022-04-15 05:46:19,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {10586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10586#false} is VALID [2022-04-15 05:46:19,413 INFO L272 TraceCheckUtils]: 52: Hoare triple {10586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {10586#false} is VALID [2022-04-15 05:46:19,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {10586#false} ~cond := #in~cond; {10586#false} is VALID [2022-04-15 05:46:19,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {10586#false} assume 0 == ~cond; {10586#false} is VALID [2022-04-15 05:46:19,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2022-04-15 05:46:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:19,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:20,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2022-04-15 05:46:20,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {10586#false} assume 0 == ~cond; {10586#false} is VALID [2022-04-15 05:46:20,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {10586#false} ~cond := #in~cond; {10586#false} is VALID [2022-04-15 05:46:20,242 INFO L272 TraceCheckUtils]: 52: Hoare triple {10586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {10586#false} is VALID [2022-04-15 05:46:20,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {10586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10586#false} is VALID [2022-04-15 05:46:20,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {10798#(< main_~i~0 1024)} assume !(~i~0 < 1024); {10586#false} is VALID [2022-04-15 05:46:20,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {10802#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10798#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:20,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {10802#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10802#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:20,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {10809#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10802#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:20,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {10809#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10809#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:20,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {10816#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10809#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:20,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {10816#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10816#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:20,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {10823#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10816#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:20,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {10823#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10823#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:20,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {10830#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10823#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:20,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {10830#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10830#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:20,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {10837#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10830#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:20,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {10837#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10837#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:20,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {10844#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10837#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:20,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {10844#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10844#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:20,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {10851#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10844#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:20,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {10851#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10851#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:20,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {10858#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10851#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:20,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {10858#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10858#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:20,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {10865#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10858#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:20,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {10865#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10865#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:20,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {10872#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10865#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:20,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {10872#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10872#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:20,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {10879#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10872#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:20,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {10879#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10879#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:20,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {10886#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10879#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:20,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {10886#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10886#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:20,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {10893#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10886#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:20,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {10893#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10893#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:20,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10893#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:20,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10900#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:20,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {10907#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10900#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:20,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {10907#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10907#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:20,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {10914#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10907#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:20,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {10914#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10914#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:20,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {10921#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10914#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:20,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {10921#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10921#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:20,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {10928#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10921#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:20,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {10928#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10928#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:20,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {10935#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10928#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:20,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {10935#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10935#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:20,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {10942#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10935#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:20,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {10942#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10942#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:20,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {10949#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10942#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:20,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {10949#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10949#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:20,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {10585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {10949#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:20,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret6 := main(); {10585#true} is VALID [2022-04-15 05:46:20,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #39#return; {10585#true} is VALID [2022-04-15 05:46:20,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2022-04-15 05:46:20,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#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(12, 2);call #Ultimate.allocInit(12, 3); {10585#true} is VALID [2022-04-15 05:46:20,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10585#true} is VALID [2022-04-15 05:46:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:20,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146888792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:20,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:20,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 05:46:20,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:20,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444575953] [2022-04-15 05:46:20,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444575953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:20,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:20,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 05:46:20,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903000981] [2022-04-15 05:46:20,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 05:46:20,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:20,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:20,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 05:46:20,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:20,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 05:46:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 05:46:20,296 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:20,817 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 05:46:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 05:46:20,817 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 05:46:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-15 05:46:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-15 05:46:20,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 66 transitions. [2022-04-15 05:46:20,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:20,876 INFO L225 Difference]: With dead ends: 66 [2022-04-15 05:46:20,876 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 05:46:20,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 05:46:20,878 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:20,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 24 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 05:46:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-15 05:46:20,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:20,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,998 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,998 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:20,999 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 05:46:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 05:46:20,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:20,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:20,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 05:46:20,999 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 05:46:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:21,000 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 05:46:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 05:46:21,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:21,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:21,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:21,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-15 05:46:21,002 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2022-04-15 05:46:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:21,002 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-15 05:46:21,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:21,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-15 05:46:21,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 05:46:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 05:46:21,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:21,075 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:21,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:21,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:21,275 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -420238296, now seen corresponding path program 45 times [2022-04-15 05:46:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:21,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [534813656] [2022-04-15 05:46:21,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:21,278 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:21,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -420238296, now seen corresponding path program 46 times [2022-04-15 05:46:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:21,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608718453] [2022-04-15 05:46:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:21,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {11418#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-15 05:46:21,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-15 05:46:21,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-15 05:46:21,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11418#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:21,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {11418#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-15 05:46:21,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-15 05:46:21,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-15 05:46:21,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret6 := main(); {11389#true} is VALID [2022-04-15 05:46:21,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {11394#(= main_~i~0 0)} is VALID [2022-04-15 05:46:21,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {11394#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11394#(= main_~i~0 0)} is VALID [2022-04-15 05:46:21,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {11394#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11395#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:21,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {11395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11395#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:21,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {11395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11396#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:21,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {11396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11396#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:21,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {11396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11397#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:21,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {11397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11397#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:21,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {11397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11398#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:21,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {11398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11398#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:21,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {11398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11399#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:21,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {11399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11399#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:21,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {11399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11400#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:21,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {11400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11400#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:21,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {11400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11401#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:21,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {11401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11401#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:21,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {11401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11402#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:21,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {11402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11402#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:21,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {11402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11403#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:21,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11403#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:21,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11404#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:21,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {11404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:21,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11405#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:21,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {11405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11405#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:21,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {11405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11406#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:21,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {11406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11406#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:21,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {11406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11407#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:21,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {11407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11407#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:21,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {11407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11408#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:21,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {11408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11408#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:21,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {11408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11409#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:21,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {11409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:21,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {11409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11410#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:21,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:21,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11411#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:21,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11411#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:21,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11412#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:21,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {11412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11412#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:21,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {11412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:21,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {11413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11413#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:21,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {11413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11414#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:21,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {11414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11414#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:21,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {11414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11415#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:21,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {11415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11415#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:21,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {11415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11416#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:21,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {11416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11416#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:21,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {11416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11417#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:21,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {11417#(<= main_~i~0 23)} assume !(~i~0 < 1024); {11390#false} is VALID [2022-04-15 05:46:21,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {11390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11390#false} is VALID [2022-04-15 05:46:21,602 INFO L272 TraceCheckUtils]: 54: Hoare triple {11390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {11390#false} is VALID [2022-04-15 05:46:21,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-15 05:46:21,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-15 05:46:21,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-15 05:46:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:21,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608718453] [2022-04-15 05:46:21,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608718453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:21,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949261385] [2022-04-15 05:46:21,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:46:21,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:21,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:21,603 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:21,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 05:46:21,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:46:21,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:21,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:46:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:21,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:22,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2022-04-15 05:46:22,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#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(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-15 05:46:22,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-15 05:46:22,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-15 05:46:22,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret6 := main(); {11389#true} is VALID [2022-04-15 05:46:22,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {11437#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:22,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {11437#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:22,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {11437#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11395#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:22,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {11395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11395#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:22,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {11395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11396#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:22,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {11396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11396#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:22,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {11396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11397#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:22,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {11397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11397#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:22,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {11397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11398#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:22,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {11398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11398#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:22,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {11398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11399#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:22,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {11399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11399#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:22,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {11399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11400#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:22,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {11400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11400#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:22,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {11400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11401#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:22,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {11401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11401#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:22,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {11401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11402#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:22,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {11402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11402#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:22,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {11402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11403#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:22,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11403#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:22,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11404#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:22,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {11404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:22,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {11404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11405#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:22,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {11405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11405#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:22,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {11405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11406#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:22,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {11406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11406#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:22,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {11406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11407#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:22,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {11407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11407#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:22,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {11407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11408#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:22,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {11408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11408#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:22,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {11408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11409#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:22,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {11409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:22,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {11409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11410#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:22,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:22,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11411#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:22,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11411#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:22,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11412#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:22,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {11412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11412#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:22,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {11412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11413#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:22,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {11413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11413#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:22,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {11413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11414#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:22,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {11414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11414#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:22,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {11414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11415#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:22,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {11415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11415#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:22,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {11415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11416#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:22,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {11416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11416#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:22,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {11416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11417#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:22,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {11417#(<= main_~i~0 23)} assume !(~i~0 < 1024); {11390#false} is VALID [2022-04-15 05:46:22,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {11390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11390#false} is VALID [2022-04-15 05:46:22,052 INFO L272 TraceCheckUtils]: 54: Hoare triple {11390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {11390#false} is VALID [2022-04-15 05:46:22,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-15 05:46:22,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-15 05:46:22,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-15 05:46:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:22,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:22,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-15 05:46:22,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-15 05:46:22,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-15 05:46:22,935 INFO L272 TraceCheckUtils]: 54: Hoare triple {11390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {11390#false} is VALID [2022-04-15 05:46:22,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {11390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11390#false} is VALID [2022-04-15 05:46:22,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {11609#(< main_~i~0 1024)} assume !(~i~0 < 1024); {11390#false} is VALID [2022-04-15 05:46:22,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {11613#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11609#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:22,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {11613#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11613#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:22,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {11620#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11613#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:22,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {11620#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11620#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:22,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {11627#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11620#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:22,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {11627#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11627#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:22,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {11634#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11627#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:22,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {11634#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11634#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:22,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {11641#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11634#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:22,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {11641#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11641#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:22,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {11648#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11641#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:22,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {11648#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11648#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:22,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {11655#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11648#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:22,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {11655#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11655#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:22,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {11662#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11655#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:22,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {11662#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11662#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:22,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {11669#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11662#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:22,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {11669#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11669#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:22,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {11676#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11669#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:22,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {11676#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11676#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:22,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {11683#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11676#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:22,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {11683#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11683#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:22,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {11690#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11683#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:22,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {11690#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11690#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:22,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {11697#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11690#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:22,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {11697#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11697#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:22,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {11704#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11697#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:22,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {11704#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11704#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:22,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {11711#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11704#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:22,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {11711#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11711#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:22,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {11718#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11711#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:22,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {11718#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11718#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:22,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {11725#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11718#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:22,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {11725#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11725#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:22,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {11732#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11725#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:22,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {11732#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11732#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:22,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {11739#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11732#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:22,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {11739#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11739#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:22,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {11746#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11739#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:22,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {11746#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11746#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:22,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {11753#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11746#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:22,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {11753#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11753#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:22,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {11760#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11753#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:22,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {11760#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11760#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:22,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {11767#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11760#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:22,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {11767#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11767#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:22,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {11767#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:22,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret6 := main(); {11389#true} is VALID [2022-04-15 05:46:22,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #39#return; {11389#true} is VALID [2022-04-15 05:46:22,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-15 05:46:22,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#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(12, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-15 05:46:22,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2022-04-15 05:46:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:22,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949261385] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:22,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:22,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 05:46:22,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [534813656] [2022-04-15 05:46:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [534813656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 05:46:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47552839] [2022-04-15 05:46:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 05:46:22,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:22,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:22,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:22,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 05:46:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 05:46:22,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:46:22,998 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:23,583 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 05:46:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 05:46:23,583 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 05:46:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-15 05:46:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-15 05:46:23,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-15 05:46:23,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:23,652 INFO L225 Difference]: With dead ends: 68 [2022-04-15 05:46:23,652 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 05:46:23,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2502, Invalid=3198, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 05:46:23,653 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:23,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 49 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 05:46:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-15 05:46:23,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:23,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,815 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,815 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:23,816 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 05:46:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 05:46:23,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:23,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:23,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 05:46:23,817 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 05:46:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:23,818 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 05:46:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 05:46:23,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:23,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:23,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:23,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-15 05:46:23,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2022-04-15 05:46:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:23,819 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-15 05:46:23,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:23,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-15 05:46:23,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 05:46:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 05:46:23,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:23,897 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:23,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:24,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:24,121 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -996164182, now seen corresponding path program 47 times [2022-04-15 05:46:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106923373] [2022-04-15 05:46:24,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:24,123 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:24,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -996164182, now seen corresponding path program 48 times [2022-04-15 05:46:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:24,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797678213] [2022-04-15 05:46:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:24,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {12251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-15 05:46:24,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-15 05:46:24,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-15 05:46:24,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {12221#true} call ULTIMATE.init(); {12251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:24,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {12251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-15 05:46:24,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-15 05:46:24,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-15 05:46:24,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {12221#true} call #t~ret6 := main(); {12221#true} is VALID [2022-04-15 05:46:24,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {12221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {12226#(= main_~i~0 0)} is VALID [2022-04-15 05:46:24,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {12226#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12226#(= main_~i~0 0)} is VALID [2022-04-15 05:46:24,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {12226#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12227#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:24,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {12227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12227#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:24,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {12227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12228#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:24,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {12228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12228#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:24,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {12228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12229#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:24,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {12229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:24,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {12229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12230#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:24,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {12230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12230#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:24,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {12230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12231#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:24,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {12231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12231#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:24,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {12231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12232#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:24,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {12232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12232#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:24,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {12232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12233#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:24,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {12233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12233#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:24,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {12233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12234#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:24,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {12234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12234#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:24,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {12234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12235#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:24,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {12235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12235#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:24,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {12235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12236#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:24,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {12236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:24,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {12236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12237#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:24,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {12237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12237#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:24,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {12237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12238#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:24,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {12238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12238#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:24,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {12238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12239#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:24,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {12239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12239#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:24,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {12239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12240#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:24,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12240#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:24,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {12240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12241#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:24,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {12241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12241#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:24,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {12241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12242#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:24,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {12242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12242#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:24,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {12242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12243#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:24,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {12243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:24,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {12243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12244#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:24,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {12244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12244#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:24,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {12244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12245#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:24,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12245#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:24,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12246#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:24,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {12246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12246#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:24,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {12246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12247#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:24,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {12247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12247#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:24,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {12247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12248#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:24,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {12248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12248#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:24,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {12248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12249#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:24,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {12249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12249#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:24,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {12249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12250#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:24,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {12250#(<= main_~i~0 24)} assume !(~i~0 < 1024); {12222#false} is VALID [2022-04-15 05:46:24,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {12222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12222#false} is VALID [2022-04-15 05:46:24,471 INFO L272 TraceCheckUtils]: 56: Hoare triple {12222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {12222#false} is VALID [2022-04-15 05:46:24,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {12222#false} ~cond := #in~cond; {12222#false} is VALID [2022-04-15 05:46:24,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {12222#false} assume 0 == ~cond; {12222#false} is VALID [2022-04-15 05:46:24,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {12222#false} assume !false; {12222#false} is VALID [2022-04-15 05:46:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797678213] [2022-04-15 05:46:24,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797678213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703559813] [2022-04-15 05:46:24,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:46:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:24,473 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:24,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 05:46:25,160 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-15 05:46:25,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:25,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 05:46:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:25,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:25,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {12221#true} call ULTIMATE.init(); {12221#true} is VALID [2022-04-15 05:46:25,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#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(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-15 05:46:25,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-15 05:46:25,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-15 05:46:25,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {12221#true} call #t~ret6 := main(); {12221#true} is VALID [2022-04-15 05:46:25,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {12221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {12270#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:25,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {12270#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12270#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:25,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {12270#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12227#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:25,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {12227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12227#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:25,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {12227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12228#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:25,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {12228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12228#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:25,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {12228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12229#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:25,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {12229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:25,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {12229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12230#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:25,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {12230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12230#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:25,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {12230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12231#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:25,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {12231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12231#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:25,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {12231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12232#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:25,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {12232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12232#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:25,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {12232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12233#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:25,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {12233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12233#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:25,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {12233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12234#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:25,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {12234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12234#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:25,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {12234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12235#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:25,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {12235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12235#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:25,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {12235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12236#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:25,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {12236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:25,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {12236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12237#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:25,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {12237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12237#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:25,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {12237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12238#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:25,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {12238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12238#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:25,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {12238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12239#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:25,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {12239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12239#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:25,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {12239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12240#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:25,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12240#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:25,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {12240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12241#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:25,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {12241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12241#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:25,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {12241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12242#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:25,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {12242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12242#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:25,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {12242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12243#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:25,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {12243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:25,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {12243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12244#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:25,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {12244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12244#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:25,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {12244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12245#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:25,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12245#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:25,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12246#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:25,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {12246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12246#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:25,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {12246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12247#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:25,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {12247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12247#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:25,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {12247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12248#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:25,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {12248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12248#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:25,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {12248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12249#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:25,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {12249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12249#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:25,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {12249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12250#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:25,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {12250#(<= main_~i~0 24)} assume !(~i~0 < 1024); {12222#false} is VALID [2022-04-15 05:46:25,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {12222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12222#false} is VALID [2022-04-15 05:46:25,514 INFO L272 TraceCheckUtils]: 56: Hoare triple {12222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {12222#false} is VALID [2022-04-15 05:46:25,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {12222#false} ~cond := #in~cond; {12222#false} is VALID [2022-04-15 05:46:25,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {12222#false} assume 0 == ~cond; {12222#false} is VALID [2022-04-15 05:46:25,514 INFO L290 TraceCheckUtils]: 59: Hoare triple {12222#false} assume !false; {12222#false} is VALID [2022-04-15 05:46:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:25,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:26,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {12222#false} assume !false; {12222#false} is VALID [2022-04-15 05:46:26,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {12222#false} assume 0 == ~cond; {12222#false} is VALID [2022-04-15 05:46:26,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {12222#false} ~cond := #in~cond; {12222#false} is VALID [2022-04-15 05:46:26,431 INFO L272 TraceCheckUtils]: 56: Hoare triple {12222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {12222#false} is VALID [2022-04-15 05:46:26,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {12222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12222#false} is VALID [2022-04-15 05:46:26,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {12448#(< main_~i~0 1024)} assume !(~i~0 < 1024); {12222#false} is VALID [2022-04-15 05:46:26,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {12452#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12448#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:26,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {12452#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12452#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:26,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {12459#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12452#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:26,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {12459#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12459#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:26,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {12466#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12459#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:26,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {12466#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12466#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:26,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {12473#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12466#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:26,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {12473#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12473#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:26,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {12480#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12473#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:26,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {12480#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12480#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:26,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {12487#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12480#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:26,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {12487#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12487#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:26,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {12494#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12487#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:26,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {12494#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12494#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:26,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {12501#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12494#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:26,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {12501#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12501#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:26,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {12508#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12501#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:26,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {12508#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12508#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:26,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {12515#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12508#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:26,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {12515#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12515#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:26,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {12522#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12515#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:26,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {12522#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12522#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:26,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {12529#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12522#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:26,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {12529#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12529#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:26,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {12536#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12529#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:26,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {12536#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12536#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:26,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {12543#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12536#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:26,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {12543#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12543#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:26,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {12550#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12543#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:26,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {12550#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12550#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:26,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {12557#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12550#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:26,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {12557#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12557#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:26,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {12564#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12557#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:26,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {12564#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12564#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:26,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {12571#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12564#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:26,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12571#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:26,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {12578#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12571#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:26,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {12578#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12578#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:26,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {12585#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12578#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:26,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {12585#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12585#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:26,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {12592#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12585#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:26,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {12592#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12592#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:26,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {12599#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12592#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:26,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {12599#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12599#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:26,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {12606#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12599#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:26,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {12606#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12606#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:26,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {12613#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12606#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:26,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {12613#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12613#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:26,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {12221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {12613#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:26,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {12221#true} call #t~ret6 := main(); {12221#true} is VALID [2022-04-15 05:46:26,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12221#true} {12221#true} #39#return; {12221#true} is VALID [2022-04-15 05:46:26,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {12221#true} assume true; {12221#true} is VALID [2022-04-15 05:46:26,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#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(12, 2);call #Ultimate.allocInit(12, 3); {12221#true} is VALID [2022-04-15 05:46:26,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {12221#true} call ULTIMATE.init(); {12221#true} is VALID [2022-04-15 05:46:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703559813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:26,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 05:46:26,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:26,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106923373] [2022-04-15 05:46:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106923373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:26,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 05:46:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216379675] [2022-04-15 05:46:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 05:46:26,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:26,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:26,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:26,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 05:46:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 05:46:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:46:26,493 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:27,081 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 05:46:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 05:46:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 05:46:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-15 05:46:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-15 05:46:27,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-15 05:46:27,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:27,133 INFO L225 Difference]: With dead ends: 70 [2022-04-15 05:46:27,133 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 05:46:27,134 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 05:46:27,134 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:27,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 05:46:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-15 05:46:27,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:27,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,275 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,275 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:27,276 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 05:46:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 05:46:27,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:27,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:27,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 05:46:27,276 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 05:46:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:27,277 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 05:46:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 05:46:27,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:27,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:27,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:27,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-15 05:46:27,279 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2022-04-15 05:46:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:27,279 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-15 05:46:27,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:27,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-15 05:46:27,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 05:46:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 05:46:27,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:27,351 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:27,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:27,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 05:46:27,567 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -410159444, now seen corresponding path program 49 times [2022-04-15 05:46:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369092747] [2022-04-15 05:46:27,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:27,570 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:27,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -410159444, now seen corresponding path program 50 times [2022-04-15 05:46:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:27,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261350296] [2022-04-15 05:46:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:27,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {13112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-15 05:46:27,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-15 05:46:27,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-15 05:46:27,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {13081#true} call ULTIMATE.init(); {13112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:27,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {13112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-15 05:46:27,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-15 05:46:27,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-15 05:46:27,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {13081#true} call #t~ret6 := main(); {13081#true} is VALID [2022-04-15 05:46:27,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {13081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13086#(= main_~i~0 0)} is VALID [2022-04-15 05:46:27,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13086#(= main_~i~0 0)} is VALID [2022-04-15 05:46:27,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {13086#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13087#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:27,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {13087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13087#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:27,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13088#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:27,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {13088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13088#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:27,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {13088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13089#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:27,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {13089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13089#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:27,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {13089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13090#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:27,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {13090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13090#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:27,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {13090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13091#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:27,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {13091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13091#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:27,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {13091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13092#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:27,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {13092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13092#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:27,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {13092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13093#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:27,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13093#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:27,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13094#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:27,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {13094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13094#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:27,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {13094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13095#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:27,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {13095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13095#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:27,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {13095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13096#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:27,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {13096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13096#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:27,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {13096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13097#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:27,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {13097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13097#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:27,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {13097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13098#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:27,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {13098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13098#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:27,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {13098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13099#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:27,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {13099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13099#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:27,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {13099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13100#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:27,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {13100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13100#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:27,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {13100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13101#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:27,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {13101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13101#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:27,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {13101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13102#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:27,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {13102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13102#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:27,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {13102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13103#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:27,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {13103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13103#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:27,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {13103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13104#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:27,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {13104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13104#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:27,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {13104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13105#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:27,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {13105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13105#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:27,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {13105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13106#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:27,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {13106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13106#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:27,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {13106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13107#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:27,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {13107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13107#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:27,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {13107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13108#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:27,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {13108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13108#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:27,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {13108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13109#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:27,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {13109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13109#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:27,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {13109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13110#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:27,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {13110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13110#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:27,954 INFO L290 TraceCheckUtils]: 55: Hoare triple {13110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13111#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:27,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {13111#(<= main_~i~0 25)} assume !(~i~0 < 1024); {13082#false} is VALID [2022-04-15 05:46:27,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {13082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13082#false} is VALID [2022-04-15 05:46:27,954 INFO L272 TraceCheckUtils]: 58: Hoare triple {13082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13082#false} is VALID [2022-04-15 05:46:27,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {13082#false} ~cond := #in~cond; {13082#false} is VALID [2022-04-15 05:46:27,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {13082#false} assume 0 == ~cond; {13082#false} is VALID [2022-04-15 05:46:27,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {13082#false} assume !false; {13082#false} is VALID [2022-04-15 05:46:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:27,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261350296] [2022-04-15 05:46:27,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261350296] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:27,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081639683] [2022-04-15 05:46:27,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:46:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:27,960 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:27,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 05:46:28,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:46:28,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:28,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 05:46:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:28,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:28,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {13081#true} call ULTIMATE.init(); {13081#true} is VALID [2022-04-15 05:46:28,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {13081#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(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-15 05:46:28,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-15 05:46:28,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-15 05:46:28,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {13081#true} call #t~ret6 := main(); {13081#true} is VALID [2022-04-15 05:46:28,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {13081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13131#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:28,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {13131#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13131#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:28,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {13131#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13087#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:28,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {13087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13087#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:28,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13088#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:28,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {13088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13088#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:28,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {13088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13089#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:28,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {13089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13089#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:28,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {13089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13090#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:28,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {13090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13090#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:28,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {13090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13091#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:28,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {13091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13091#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:28,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {13091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13092#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:28,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {13092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13092#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:28,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {13092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13093#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:28,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13093#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:28,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13094#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:28,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {13094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13094#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:28,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {13094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13095#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:28,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {13095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13095#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:28,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {13095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13096#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:28,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {13096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13096#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:28,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {13096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13097#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:28,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {13097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13097#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:28,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {13097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13098#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:28,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {13098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13098#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:28,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {13098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13099#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:28,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {13099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13099#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:28,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {13099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13100#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:28,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {13100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13100#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:28,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {13100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13101#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:28,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {13101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13101#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:28,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {13101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13102#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:28,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {13102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13102#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:28,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {13102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13103#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:28,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {13103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13103#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:28,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {13103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13104#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:28,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {13104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13104#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:28,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {13104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13105#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:28,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {13105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13105#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:28,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {13105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13106#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:28,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {13106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13106#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:28,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {13106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13107#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:28,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {13107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13107#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:28,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {13107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13108#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:28,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {13108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13108#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:28,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {13108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13109#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:28,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {13109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13109#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:28,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {13109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13110#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:28,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {13110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13110#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:28,437 INFO L290 TraceCheckUtils]: 55: Hoare triple {13110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13111#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:28,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {13111#(<= main_~i~0 25)} assume !(~i~0 < 1024); {13082#false} is VALID [2022-04-15 05:46:28,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {13082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13082#false} is VALID [2022-04-15 05:46:28,437 INFO L272 TraceCheckUtils]: 58: Hoare triple {13082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13082#false} is VALID [2022-04-15 05:46:28,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {13082#false} ~cond := #in~cond; {13082#false} is VALID [2022-04-15 05:46:28,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {13082#false} assume 0 == ~cond; {13082#false} is VALID [2022-04-15 05:46:28,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {13082#false} assume !false; {13082#false} is VALID [2022-04-15 05:46:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:28,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:29,450 INFO L290 TraceCheckUtils]: 61: Hoare triple {13082#false} assume !false; {13082#false} is VALID [2022-04-15 05:46:29,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {13082#false} assume 0 == ~cond; {13082#false} is VALID [2022-04-15 05:46:29,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {13082#false} ~cond := #in~cond; {13082#false} is VALID [2022-04-15 05:46:29,451 INFO L272 TraceCheckUtils]: 58: Hoare triple {13082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13082#false} is VALID [2022-04-15 05:46:29,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {13082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13082#false} is VALID [2022-04-15 05:46:29,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {13315#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13082#false} is VALID [2022-04-15 05:46:29,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {13319#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13315#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:29,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {13319#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13319#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:29,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {13326#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13319#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:29,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {13326#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13326#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:29,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {13333#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13326#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:29,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {13333#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13333#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:29,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {13340#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13333#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:29,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {13340#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13340#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:29,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {13347#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13340#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:29,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {13347#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13347#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:29,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {13354#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13347#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:29,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {13354#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13354#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:29,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13354#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:29,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {13361#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13361#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:29,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {13368#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13361#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:29,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {13368#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13368#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:29,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {13375#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13368#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:29,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {13375#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13375#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:29,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {13382#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13375#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:29,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {13382#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13382#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:29,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {13389#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13382#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:29,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {13389#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13389#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:29,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {13396#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13389#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:29,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {13396#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13396#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:29,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {13403#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13396#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:29,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {13403#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13403#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:29,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {13410#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13403#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:29,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {13410#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13410#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:29,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {13417#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13410#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:29,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {13417#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13417#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:29,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {13424#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13417#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:29,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {13424#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13424#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:29,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {13431#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13424#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:29,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {13431#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13431#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:29,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {13438#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13431#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:29,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {13438#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13438#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:29,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {13445#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13438#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:29,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {13445#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13445#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:29,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {13452#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13445#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:29,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {13452#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13452#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:29,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {13459#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13452#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:29,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {13459#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13459#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:29,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {13466#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13459#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:29,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {13466#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13466#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:29,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {13473#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13466#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:29,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {13473#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13473#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:29,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {13480#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13473#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:29,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {13480#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13480#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:29,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {13487#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13480#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:29,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {13487#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13487#(< main_~i~0 999)} is VALID [2022-04-15 05:46:29,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {13081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13487#(< main_~i~0 999)} is VALID [2022-04-15 05:46:29,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {13081#true} call #t~ret6 := main(); {13081#true} is VALID [2022-04-15 05:46:29,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13081#true} {13081#true} #39#return; {13081#true} is VALID [2022-04-15 05:46:29,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {13081#true} assume true; {13081#true} is VALID [2022-04-15 05:46:29,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {13081#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(12, 2);call #Ultimate.allocInit(12, 3); {13081#true} is VALID [2022-04-15 05:46:29,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {13081#true} call ULTIMATE.init(); {13081#true} is VALID [2022-04-15 05:46:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:29,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081639683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:29,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:29,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 05:46:29,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:29,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369092747] [2022-04-15 05:46:29,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369092747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:29,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:29,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 05:46:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586137208] [2022-04-15 05:46:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 05:46:29,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:29,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:29,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:29,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 05:46:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 05:46:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 05:46:29,510 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:30,152 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 05:46:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 05:46:30,155 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 05:46:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-15 05:46:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-15 05:46:30,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 72 transitions. [2022-04-15 05:46:30,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:30,226 INFO L225 Difference]: With dead ends: 72 [2022-04-15 05:46:30,226 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 05:46:30,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 05:46:30,228 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:30,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 05:46:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-15 05:46:30,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:30,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,416 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,416 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:30,418 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 05:46:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 05:46:30,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:30,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:30,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 05:46:30,419 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 05:46:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:30,420 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 05:46:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 05:46:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:30,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:30,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:30,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-15 05:46:30,422 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2022-04-15 05:46:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:30,423 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-15 05:46:30,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:30,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-15 05:46:30,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 05:46:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 05:46:30,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:30,490 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:30,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:30,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 05:46:30,703 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 99677998, now seen corresponding path program 51 times [2022-04-15 05:46:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:30,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1967084762] [2022-04-15 05:46:30,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:30,707 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:30,707 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 99677998, now seen corresponding path program 52 times [2022-04-15 05:46:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:30,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963046518] [2022-04-15 05:46:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:31,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {14001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-15 05:46:31,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-15 05:46:31,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-15 05:46:31,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {13969#true} call ULTIMATE.init(); {14001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:31,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {14001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-15 05:46:31,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-15 05:46:31,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-15 05:46:31,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {13969#true} call #t~ret6 := main(); {13969#true} is VALID [2022-04-15 05:46:31,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {13969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {13974#(= main_~i~0 0)} is VALID [2022-04-15 05:46:31,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {13974#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13974#(= main_~i~0 0)} is VALID [2022-04-15 05:46:31,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {13974#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13975#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:31,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {13975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13975#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:31,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13976#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:31,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {13976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13976#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:31,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {13976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13977#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:31,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13977#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:31,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13978#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:31,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13978#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:31,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13979#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:31,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {13979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13979#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:31,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {13979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13980#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:31,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {13980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13980#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:31,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {13980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13981#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:31,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {13981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13981#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:31,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {13981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13982#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:31,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {13982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13982#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:31,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {13982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13983#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:31,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {13983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13983#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:31,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {13983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13984#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:31,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {13984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13984#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:31,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {13984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13985#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:31,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {13985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13985#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:31,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {13985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13986#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:31,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {13986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13986#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:31,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {13986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13987#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:31,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {13987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13987#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:31,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {13987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13988#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:31,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13988#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:31,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13989#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:31,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13989#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:31,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {13989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13990#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:31,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {13990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13990#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:31,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {13990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13991#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:31,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {13991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13991#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:31,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {13991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13992#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:31,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {13992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13992#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:31,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {13992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13993#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:31,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {13993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13993#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:31,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {13993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13994#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:31,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {13994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13994#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:31,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {13994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13995#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:31,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {13995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13995#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:31,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {13995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13996#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:31,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {13996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13996#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:31,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {13996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13997#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:31,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {13997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13997#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:31,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {13997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13998#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:31,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {13998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:31,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {13998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13999#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:31,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {13999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:31,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {13999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14000#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:31,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {14000#(<= main_~i~0 26)} assume !(~i~0 < 1024); {13970#false} is VALID [2022-04-15 05:46:31,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13970#false} is VALID [2022-04-15 05:46:31,128 INFO L272 TraceCheckUtils]: 60: Hoare triple {13970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13970#false} is VALID [2022-04-15 05:46:31,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} ~cond := #in~cond; {13970#false} is VALID [2022-04-15 05:46:31,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume 0 == ~cond; {13970#false} is VALID [2022-04-15 05:46:31,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-04-15 05:46:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:31,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963046518] [2022-04-15 05:46:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963046518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:31,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125050157] [2022-04-15 05:46:31,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:46:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:31,131 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:31,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 05:46:31,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:46:31,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:31,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 05:46:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:31,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:31,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {13969#true} call ULTIMATE.init(); {13969#true} is VALID [2022-04-15 05:46:31,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#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(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-15 05:46:31,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-15 05:46:31,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-15 05:46:31,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {13969#true} call #t~ret6 := main(); {13969#true} is VALID [2022-04-15 05:46:31,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {13969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14020#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:31,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {14020#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14020#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:31,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {14020#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13975#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:31,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {13975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13975#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:31,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {13975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13976#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:31,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {13976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13976#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:31,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {13976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13977#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:31,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13977#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:31,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13978#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:31,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13978#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:31,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13979#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:31,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {13979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13979#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:31,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {13979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13980#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:31,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {13980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13980#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:31,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {13980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13981#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:31,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {13981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13981#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:31,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {13981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13982#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:31,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {13982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13982#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:31,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {13982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13983#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:31,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {13983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13983#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:31,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {13983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13984#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:31,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {13984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13984#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:31,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {13984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13985#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:31,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {13985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13985#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:31,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {13985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13986#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:31,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {13986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13986#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:31,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {13986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13987#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:31,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {13987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13987#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:31,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {13987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13988#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:31,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13988#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:31,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13989#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:31,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13989#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:31,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {13989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13990#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:31,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {13990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13990#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:31,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {13990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13991#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:31,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {13991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13991#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:31,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {13991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13992#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:31,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {13992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13992#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:31,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {13992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13993#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:31,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {13993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13993#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:31,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {13993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13994#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:31,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {13994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13994#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:31,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {13994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13995#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:31,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {13995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13995#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:31,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {13995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13996#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:31,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {13996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13996#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:31,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {13996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13997#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:31,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {13997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13997#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:31,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {13997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13998#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:31,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {13998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:31,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {13998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13999#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:31,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {13999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:31,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {13999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14000#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:31,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {14000#(<= main_~i~0 26)} assume !(~i~0 < 1024); {13970#false} is VALID [2022-04-15 05:46:31,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13970#false} is VALID [2022-04-15 05:46:31,770 INFO L272 TraceCheckUtils]: 60: Hoare triple {13970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13970#false} is VALID [2022-04-15 05:46:31,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} ~cond := #in~cond; {13970#false} is VALID [2022-04-15 05:46:31,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume 0 == ~cond; {13970#false} is VALID [2022-04-15 05:46:31,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-04-15 05:46:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:31,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:32,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {13970#false} assume !false; {13970#false} is VALID [2022-04-15 05:46:32,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {13970#false} assume 0 == ~cond; {13970#false} is VALID [2022-04-15 05:46:32,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {13970#false} ~cond := #in~cond; {13970#false} is VALID [2022-04-15 05:46:32,828 INFO L272 TraceCheckUtils]: 60: Hoare triple {13970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {13970#false} is VALID [2022-04-15 05:46:32,828 INFO L290 TraceCheckUtils]: 59: Hoare triple {13970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13970#false} is VALID [2022-04-15 05:46:32,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {14210#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13970#false} is VALID [2022-04-15 05:46:32,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {14214#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14210#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:32,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {14214#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14214#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:32,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {14221#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14214#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:32,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {14221#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14221#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:32,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {14228#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14221#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:32,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {14228#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14228#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:32,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {14235#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14228#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:32,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {14235#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14235#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:32,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {14242#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14235#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:32,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {14242#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14242#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:32,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {14249#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14242#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:32,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {14249#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14249#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:32,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {14256#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14249#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:32,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {14256#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14256#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:32,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {14263#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14256#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:32,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {14263#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14263#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:32,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {14270#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14263#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:32,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {14270#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14270#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:32,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {14277#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14270#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:32,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {14277#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14277#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:32,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {14284#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14277#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:32,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {14284#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14284#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:32,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {14291#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14284#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:32,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {14291#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14291#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:32,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {14298#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14291#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:32,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {14298#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14298#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:32,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {14305#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14298#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:32,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {14305#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14305#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:32,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {14312#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14305#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:32,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {14312#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14312#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:32,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {14319#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14312#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:32,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {14319#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14319#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:32,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {14326#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14319#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:32,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {14326#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14326#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:32,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {14333#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14326#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:32,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {14333#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14333#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:32,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {14340#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14333#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:32,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {14340#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14340#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:32,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {14347#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14340#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:32,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {14347#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14347#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:32,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {14354#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14347#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:32,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {14354#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14354#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:32,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {14361#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14354#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:32,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {14361#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14361#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:32,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14361#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:32,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {14368#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14368#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:32,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {14375#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14368#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:32,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {14375#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14375#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:32,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {14382#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14375#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:32,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {14382#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14382#(< main_~i~0 999)} is VALID [2022-04-15 05:46:32,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {14389#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14382#(< main_~i~0 999)} is VALID [2022-04-15 05:46:32,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {14389#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14389#(< main_~i~0 998)} is VALID [2022-04-15 05:46:32,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {13969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14389#(< main_~i~0 998)} is VALID [2022-04-15 05:46:32,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {13969#true} call #t~ret6 := main(); {13969#true} is VALID [2022-04-15 05:46:32,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13969#true} {13969#true} #39#return; {13969#true} is VALID [2022-04-15 05:46:32,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {13969#true} assume true; {13969#true} is VALID [2022-04-15 05:46:32,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#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(12, 2);call #Ultimate.allocInit(12, 3); {13969#true} is VALID [2022-04-15 05:46:32,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {13969#true} call ULTIMATE.init(); {13969#true} is VALID [2022-04-15 05:46:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125050157] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:32,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 05:46:32,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1967084762] [2022-04-15 05:46:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1967084762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:32,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:32,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 05:46:32,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040770905] [2022-04-15 05:46:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:32,847 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 05:46:32,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:32,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:32,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:32,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 05:46:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 05:46:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 05:46:32,889 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:33,597 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 05:46:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 05:46:33,598 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 05:46:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-15 05:46:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-15 05:46:33,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 74 transitions. [2022-04-15 05:46:33,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:33,669 INFO L225 Difference]: With dead ends: 74 [2022-04-15 05:46:33,669 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 05:46:33,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3138, Invalid=4002, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 05:46:33,670 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:33,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 39 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 05:46:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-15 05:46:33,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:33,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,829 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,829 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:33,830 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 05:46:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 05:46:33,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:33,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:33,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 05:46:33,830 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 05:46:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:33,831 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 05:46:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 05:46:33,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:33,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:33,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:33,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-15 05:46:33,833 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2022-04-15 05:46:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:33,833 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-15 05:46:33,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:33,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-15 05:46:33,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 05:46:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 05:46:33,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:33,901 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:33,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 05:46:34,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 05:46:34,101 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash 427188016, now seen corresponding path program 53 times [2022-04-15 05:46:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:34,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789885957] [2022-04-15 05:46:34,104 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:34,104 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:34,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash 427188016, now seen corresponding path program 54 times [2022-04-15 05:46:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:34,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755385986] [2022-04-15 05:46:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:34,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:34,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {14918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-15 05:46:34,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 05:46:34,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-15 05:46:34,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:34,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {14918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-15 05:46:34,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 05:46:34,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-15 05:46:34,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret6 := main(); {14885#true} is VALID [2022-04-15 05:46:34,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14890#(= main_~i~0 0)} is VALID [2022-04-15 05:46:34,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {14890#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14890#(= main_~i~0 0)} is VALID [2022-04-15 05:46:34,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {14890#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14891#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:34,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14891#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:34,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {14891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14892#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:34,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14892#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:34,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14893#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:34,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {14893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14893#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:34,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {14893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14894#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:34,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {14894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14894#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:34,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {14894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14895#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:34,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {14895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14895#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:34,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {14895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14896#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:34,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {14896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14896#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:34,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {14896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14897#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:34,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {14897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14897#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:34,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {14897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14898#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:34,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {14898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14898#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:34,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {14898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14899#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:34,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {14899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14899#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:34,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {14899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14900#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:34,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {14900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14900#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:34,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {14900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14901#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:34,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {14901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14901#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:34,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {14901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14902#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:34,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {14902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14902#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:34,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {14902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14903#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:34,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {14903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14903#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:34,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {14903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14904#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:34,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {14904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14904#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:34,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {14904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14905#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:34,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {14905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14905#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:34,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {14905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14906#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:34,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {14906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14906#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:34,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {14906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14907#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:34,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {14907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14907#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:34,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {14907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14908#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:34,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {14908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14908#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:34,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {14908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14909#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:34,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {14909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14909#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:34,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {14909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14910#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:34,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {14910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14910#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:34,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {14910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14911#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:34,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {14911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14911#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:34,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14912#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:34,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {14912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14912#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:34,571 INFO L290 TraceCheckUtils]: 51: Hoare triple {14912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14913#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:34,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {14913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14913#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:34,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {14913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14914#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:34,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {14914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14914#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:34,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {14914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14915#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:34,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {14915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14915#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:34,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {14915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14916#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:34,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {14916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14916#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:34,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {14916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14917#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:34,575 INFO L290 TraceCheckUtils]: 60: Hoare triple {14917#(<= main_~i~0 27)} assume !(~i~0 < 1024); {14886#false} is VALID [2022-04-15 05:46:34,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {14886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14886#false} is VALID [2022-04-15 05:46:34,575 INFO L272 TraceCheckUtils]: 62: Hoare triple {14886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {14886#false} is VALID [2022-04-15 05:46:34,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {14886#false} ~cond := #in~cond; {14886#false} is VALID [2022-04-15 05:46:34,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {14886#false} assume 0 == ~cond; {14886#false} is VALID [2022-04-15 05:46:34,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-15 05:46:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:34,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755385986] [2022-04-15 05:46:34,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755385986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:34,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007950688] [2022-04-15 05:46:34,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:46:34,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:34,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:34,580 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:34,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 05:46:41,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 05:46:41,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:41,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:46:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:41,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:41,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14885#true} is VALID [2022-04-15 05:46:41,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#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(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-15 05:46:41,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 05:46:41,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-15 05:46:41,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret6 := main(); {14885#true} is VALID [2022-04-15 05:46:41,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {14937#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:41,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {14937#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14937#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:41,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {14937#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14891#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:41,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14891#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:41,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {14891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14892#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:41,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14892#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:41,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14893#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:41,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {14893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14893#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:41,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {14893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14894#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:41,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {14894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14894#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:41,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {14894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14895#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:41,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {14895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14895#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:41,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {14895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14896#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:41,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {14896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14896#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:41,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {14896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14897#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:41,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {14897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14897#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:41,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {14897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14898#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:41,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {14898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14898#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:41,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {14898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14899#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:41,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {14899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14899#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:41,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {14899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14900#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:41,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {14900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14900#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:41,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {14900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14901#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:41,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {14901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14901#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:41,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {14901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14902#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:41,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {14902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14902#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:41,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {14902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14903#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:41,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {14903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14903#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:41,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {14903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14904#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:41,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {14904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14904#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:41,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {14904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14905#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:41,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {14905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14905#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:41,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {14905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14906#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:41,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {14906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14906#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:41,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {14906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14907#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:41,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {14907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14907#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:41,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {14907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14908#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:41,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {14908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14908#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:41,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {14908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14909#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:41,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {14909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14909#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:41,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {14909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14910#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:41,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {14910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14910#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:41,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {14910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14911#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:41,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {14911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14911#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:41,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14912#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:41,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {14912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14912#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:41,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {14912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14913#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:41,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {14913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14913#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:41,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {14913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14914#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:41,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {14914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14914#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:41,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {14914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14915#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:41,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {14915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14915#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:41,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {14915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14916#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:41,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {14916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14916#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:41,477 INFO L290 TraceCheckUtils]: 59: Hoare triple {14916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14917#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:41,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {14917#(<= main_~i~0 27)} assume !(~i~0 < 1024); {14886#false} is VALID [2022-04-15 05:46:41,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {14886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14886#false} is VALID [2022-04-15 05:46:41,477 INFO L272 TraceCheckUtils]: 62: Hoare triple {14886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {14886#false} is VALID [2022-04-15 05:46:41,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {14886#false} ~cond := #in~cond; {14886#false} is VALID [2022-04-15 05:46:41,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {14886#false} assume 0 == ~cond; {14886#false} is VALID [2022-04-15 05:46:41,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-15 05:46:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:41,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:42,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-15 05:46:42,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {14886#false} assume 0 == ~cond; {14886#false} is VALID [2022-04-15 05:46:42,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {14886#false} ~cond := #in~cond; {14886#false} is VALID [2022-04-15 05:46:42,559 INFO L272 TraceCheckUtils]: 62: Hoare triple {14886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {14886#false} is VALID [2022-04-15 05:46:42,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {14886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14886#false} is VALID [2022-04-15 05:46:42,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {15133#(< main_~i~0 1024)} assume !(~i~0 < 1024); {14886#false} is VALID [2022-04-15 05:46:42,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {15137#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15133#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:42,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {15137#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15137#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:42,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15137#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:42,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15144#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:42,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {15151#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15144#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:42,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {15151#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15151#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:42,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {15158#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15151#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:42,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {15158#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15158#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:42,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {15165#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15158#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:42,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {15165#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15165#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:42,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {15172#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15165#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:42,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {15172#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15172#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:42,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {15179#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15172#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:42,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {15179#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15179#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:42,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {15186#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15179#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:42,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {15186#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15186#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:42,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {15193#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15186#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:42,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {15193#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15193#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:42,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {15200#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15193#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:42,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {15200#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15200#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:42,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {15207#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15200#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:42,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {15207#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15207#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:42,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {15214#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15207#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:42,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {15214#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15214#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:42,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {15221#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15214#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:42,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {15221#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15221#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:42,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {15228#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15221#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:42,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {15228#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15228#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:42,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {15235#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15228#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:42,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {15235#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15235#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:42,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {15242#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15235#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:42,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {15242#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15242#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:42,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {15249#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15242#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:42,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {15249#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15249#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:42,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {15256#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15249#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:42,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {15256#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15256#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:42,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {15263#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15256#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:42,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {15263#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15263#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:42,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {15270#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15263#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:42,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {15270#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15270#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:42,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {15277#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15270#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:42,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {15277#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15277#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:42,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {15284#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15277#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:42,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {15284#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15284#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:42,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {15291#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15284#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:42,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {15291#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15291#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:42,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {15298#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15291#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:42,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {15298#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15298#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:42,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {15305#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15298#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:42,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {15305#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15305#(< main_~i~0 999)} is VALID [2022-04-15 05:46:42,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {15312#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15305#(< main_~i~0 999)} is VALID [2022-04-15 05:46:42,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {15312#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15312#(< main_~i~0 998)} is VALID [2022-04-15 05:46:42,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {15319#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15312#(< main_~i~0 998)} is VALID [2022-04-15 05:46:42,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {15319#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15319#(< main_~i~0 997)} is VALID [2022-04-15 05:46:42,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {15319#(< main_~i~0 997)} is VALID [2022-04-15 05:46:42,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret6 := main(); {14885#true} is VALID [2022-04-15 05:46:42,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #39#return; {14885#true} is VALID [2022-04-15 05:46:42,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-15 05:46:42,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#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(12, 2);call #Ultimate.allocInit(12, 3); {14885#true} is VALID [2022-04-15 05:46:42,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14885#true} is VALID [2022-04-15 05:46:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:42,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007950688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:42,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:42,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 05:46:42,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:42,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789885957] [2022-04-15 05:46:42,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789885957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:42,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:42,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 05:46:42,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234458816] [2022-04-15 05:46:42,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:42,579 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 05:46:42,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:42,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:42,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:42,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 05:46:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:42,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 05:46:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 05:46:42,622 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:43,338 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 05:46:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 05:46:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 05:46:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-15 05:46:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-15 05:46:43,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 76 transitions. [2022-04-15 05:46:43,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:43,418 INFO L225 Difference]: With dead ends: 76 [2022-04-15 05:46:43,418 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 05:46:43,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 05:46:43,421 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:43,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 39 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 05:46:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-15 05:46:43,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:43,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,642 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,642 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:43,643 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 05:46:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 05:46:43,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:43,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:43,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 05:46:43,646 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 05:46:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:43,647 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 05:46:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 05:46:43,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:43,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:43,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:43,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-15 05:46:43,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2022-04-15 05:46:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:43,649 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-15 05:46:43,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:43,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-15 05:46:43,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 05:46:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 05:46:43,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:43,727 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:43,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:43,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 05:46:43,950 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1631702706, now seen corresponding path program 55 times [2022-04-15 05:46:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:43,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1986795568] [2022-04-15 05:46:43,953 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:43,953 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:43,953 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1631702706, now seen corresponding path program 56 times [2022-04-15 05:46:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:43,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163896388] [2022-04-15 05:46:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:44,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {15863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-15 05:46:44,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-15 05:46:44,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-15 05:46:44,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {15829#true} call ULTIMATE.init(); {15863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:44,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {15863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-15 05:46:44,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-15 05:46:44,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-15 05:46:44,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {15829#true} call #t~ret6 := main(); {15829#true} is VALID [2022-04-15 05:46:44,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {15829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {15834#(= main_~i~0 0)} is VALID [2022-04-15 05:46:44,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {15834#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15834#(= main_~i~0 0)} is VALID [2022-04-15 05:46:44,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {15834#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15835#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:44,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {15835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15835#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:44,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {15835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15836#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:44,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {15836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15836#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:44,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {15836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15837#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:44,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {15837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15837#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:44,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {15837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15838#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:44,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {15838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15838#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:44,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {15838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15839#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:44,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {15839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15839#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:44,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {15839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15840#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:44,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {15840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15840#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:44,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {15840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15841#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:44,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {15841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15841#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:44,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {15841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15842#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:44,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {15842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15842#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:44,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {15842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15843#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:44,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {15843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15843#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:44,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {15843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15844#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:44,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {15844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15844#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:44,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {15844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15845#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:44,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {15845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15845#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:44,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {15845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15846#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:44,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {15846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15846#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:44,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {15846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15847#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:44,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {15847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15847#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:44,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {15847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15848#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:44,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {15848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15848#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:44,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {15848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15849#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:44,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {15849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15849#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:44,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {15849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15850#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:44,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {15850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15850#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:44,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {15850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15851#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:44,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {15851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15851#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:44,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {15851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15852#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:44,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {15852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15852#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:44,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {15852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15853#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:44,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {15853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15853#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:44,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {15853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15854#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:44,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {15854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15854#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:44,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {15854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15855#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:44,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {15855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15855#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:44,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {15855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15856#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:44,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {15856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15856#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:44,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {15856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15857#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:44,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {15857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15857#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:44,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {15857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15858#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:44,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {15858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15858#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:44,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {15858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15859#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:44,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {15859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15859#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:44,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {15859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15860#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:44,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {15860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15860#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:44,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {15860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15861#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:44,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {15861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15861#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:44,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {15861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15862#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:44,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {15862#(<= main_~i~0 28)} assume !(~i~0 < 1024); {15830#false} is VALID [2022-04-15 05:46:44,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {15830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15830#false} is VALID [2022-04-15 05:46:44,379 INFO L272 TraceCheckUtils]: 64: Hoare triple {15830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {15830#false} is VALID [2022-04-15 05:46:44,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {15830#false} ~cond := #in~cond; {15830#false} is VALID [2022-04-15 05:46:44,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {15830#false} assume 0 == ~cond; {15830#false} is VALID [2022-04-15 05:46:44,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#false} assume !false; {15830#false} is VALID [2022-04-15 05:46:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:44,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163896388] [2022-04-15 05:46:44,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163896388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:44,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773750603] [2022-04-15 05:46:44,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:46:44,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:44,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:44,381 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:44,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 05:46:44,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:46:44,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:44,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 05:46:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:44,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:44,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {15829#true} call ULTIMATE.init(); {15829#true} is VALID [2022-04-15 05:46:44,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {15829#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(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-15 05:46:44,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-15 05:46:44,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-15 05:46:44,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {15829#true} call #t~ret6 := main(); {15829#true} is VALID [2022-04-15 05:46:44,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {15829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {15882#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:44,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {15882#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15882#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:44,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {15882#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15835#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:44,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {15835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15835#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:44,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {15835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15836#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:44,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {15836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15836#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:44,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {15836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15837#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:44,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {15837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15837#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:44,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {15837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15838#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:44,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {15838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15838#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:44,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {15838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15839#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:44,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {15839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15839#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:44,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {15839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15840#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:44,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {15840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15840#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:44,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {15840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15841#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:44,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {15841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15841#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:44,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {15841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15842#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:44,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {15842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15842#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:44,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {15842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15843#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:44,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {15843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15843#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:44,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {15843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15844#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:44,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {15844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15844#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:44,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {15844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15845#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:44,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {15845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15845#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:44,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {15845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15846#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:44,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {15846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15846#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:44,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {15846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15847#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:44,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {15847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15847#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:44,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {15847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15848#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:44,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {15848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15848#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:44,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {15848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15849#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:44,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {15849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15849#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:44,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {15849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15850#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:44,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {15850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15850#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:44,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {15850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15851#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:44,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {15851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15851#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:44,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {15851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15852#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:44,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {15852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15852#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:44,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {15852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15853#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:44,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {15853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15853#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:44,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {15853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15854#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:44,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {15854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15854#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:44,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {15854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15855#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:44,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {15855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15855#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:44,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {15855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15856#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:44,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {15856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15856#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:44,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {15856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15857#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:44,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {15857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15857#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:44,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {15857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15858#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:44,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {15858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15858#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:44,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {15858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15859#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:44,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {15859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15859#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:44,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {15859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15860#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:44,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {15860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15860#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:44,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {15860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15861#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:44,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {15861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15861#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:44,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {15861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15862#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:44,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {15862#(<= main_~i~0 28)} assume !(~i~0 < 1024); {15830#false} is VALID [2022-04-15 05:46:44,901 INFO L290 TraceCheckUtils]: 63: Hoare triple {15830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15830#false} is VALID [2022-04-15 05:46:44,901 INFO L272 TraceCheckUtils]: 64: Hoare triple {15830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {15830#false} is VALID [2022-04-15 05:46:44,901 INFO L290 TraceCheckUtils]: 65: Hoare triple {15830#false} ~cond := #in~cond; {15830#false} is VALID [2022-04-15 05:46:44,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {15830#false} assume 0 == ~cond; {15830#false} is VALID [2022-04-15 05:46:44,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#false} assume !false; {15830#false} is VALID [2022-04-15 05:46:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:44,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:46,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#false} assume !false; {15830#false} is VALID [2022-04-15 05:46:46,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {15830#false} assume 0 == ~cond; {15830#false} is VALID [2022-04-15 05:46:46,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {15830#false} ~cond := #in~cond; {15830#false} is VALID [2022-04-15 05:46:46,062 INFO L272 TraceCheckUtils]: 64: Hoare triple {15830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {15830#false} is VALID [2022-04-15 05:46:46,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {15830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15830#false} is VALID [2022-04-15 05:46:46,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {16084#(< main_~i~0 1024)} assume !(~i~0 < 1024); {15830#false} is VALID [2022-04-15 05:46:46,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {16088#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16084#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:46,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {16088#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16088#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:46,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {16095#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16088#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:46,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {16095#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16095#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:46,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {16102#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16095#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:46,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {16102#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16102#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:46,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {16109#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16102#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:46,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {16109#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16109#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:46,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {16116#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16109#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:46,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {16116#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16116#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:46,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {16123#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16116#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:46,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {16123#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16123#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:46,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {16130#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16123#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:46,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {16130#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16130#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:46,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {16137#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16130#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:46,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {16137#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16137#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:46,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {16144#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16137#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:46,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {16144#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16144#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:46,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {16151#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16144#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:46,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {16151#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16151#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:46,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {16158#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16151#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:46,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {16158#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16158#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:46,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {16165#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16158#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:46,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {16165#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16165#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:46,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {16172#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16165#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:46,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {16172#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16172#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:46,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {16179#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16172#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:46,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {16179#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16179#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:46,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {16186#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16179#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:46,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {16186#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16186#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:46,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {16193#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16186#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:46,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {16193#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16193#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:46,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {16200#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16193#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:46,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {16200#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16200#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:46,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {16207#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16200#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:46,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {16207#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16207#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:46,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {16214#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16207#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:46,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {16214#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16214#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:46,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {16221#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16214#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:46,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {16221#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16221#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:46,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {16228#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16221#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:46,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {16228#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16228#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:46,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {16235#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16228#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:46,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {16235#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16235#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:46,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {16242#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16235#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:46,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {16242#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16242#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:46,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {16249#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16242#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:46,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {16249#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16249#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:46,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {16256#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16249#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:46,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {16256#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16256#(< main_~i~0 999)} is VALID [2022-04-15 05:46:46,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {16263#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16256#(< main_~i~0 999)} is VALID [2022-04-15 05:46:46,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {16263#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16263#(< main_~i~0 998)} is VALID [2022-04-15 05:46:46,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {16270#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16263#(< main_~i~0 998)} is VALID [2022-04-15 05:46:46,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {16270#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16270#(< main_~i~0 997)} is VALID [2022-04-15 05:46:46,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {16277#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16270#(< main_~i~0 997)} is VALID [2022-04-15 05:46:46,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {16277#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16277#(< main_~i~0 996)} is VALID [2022-04-15 05:46:46,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {15829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {16277#(< main_~i~0 996)} is VALID [2022-04-15 05:46:46,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {15829#true} call #t~ret6 := main(); {15829#true} is VALID [2022-04-15 05:46:46,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15829#true} {15829#true} #39#return; {15829#true} is VALID [2022-04-15 05:46:46,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {15829#true} assume true; {15829#true} is VALID [2022-04-15 05:46:46,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {15829#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(12, 2);call #Ultimate.allocInit(12, 3); {15829#true} is VALID [2022-04-15 05:46:46,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {15829#true} call ULTIMATE.init(); {15829#true} is VALID [2022-04-15 05:46:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:46,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773750603] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:46,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:46,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 05:46:46,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:46,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1986795568] [2022-04-15 05:46:46,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1986795568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:46,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:46,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 05:46:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784220784] [2022-04-15 05:46:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 05:46:46,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:46,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:46,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:46,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 05:46:46,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 05:46:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 05:46:46,143 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:47,001 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 05:46:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 05:46:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 05:46:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-15 05:46:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-15 05:46:47,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 78 transitions. [2022-04-15 05:46:47,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:47,084 INFO L225 Difference]: With dead ends: 78 [2022-04-15 05:46:47,084 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 05:46:47,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 05:46:47,091 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:47,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 34 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 05:46:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-04-15 05:46:47,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:47,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,340 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,340 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:47,341 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 05:46:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 05:46:47,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:47,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:47,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 05:46:47,342 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 05:46:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:47,343 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 05:46:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 05:46:47,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:47,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:47,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:47,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-15 05:46:47,346 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2022-04-15 05:46:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:47,346 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-15 05:46:47,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:47,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-15 05:46:47,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 05:46:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 05:46:47,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:47,434 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:47,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:47,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 05:46:47,657 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash -470850124, now seen corresponding path program 57 times [2022-04-15 05:46:47,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:47,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113639746] [2022-04-15 05:46:47,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:47,661 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:47,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -470850124, now seen corresponding path program 58 times [2022-04-15 05:46:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:47,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340171503] [2022-04-15 05:46:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:48,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:48,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {16836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-15 05:46:48,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-15 05:46:48,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-15 05:46:48,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {16801#true} call ULTIMATE.init(); {16836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:48,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {16836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-15 05:46:48,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-15 05:46:48,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-15 05:46:48,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {16801#true} call #t~ret6 := main(); {16801#true} is VALID [2022-04-15 05:46:48,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {16801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {16806#(= main_~i~0 0)} is VALID [2022-04-15 05:46:48,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {16806#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16806#(= main_~i~0 0)} is VALID [2022-04-15 05:46:48,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {16806#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16807#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:48,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {16807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16807#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:48,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {16807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16808#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:48,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {16808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16808#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:48,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {16808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16809#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:48,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {16809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16809#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:48,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {16809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16810#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:48,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {16810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16810#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:48,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {16810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16811#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:48,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {16811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16811#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:48,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {16811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16812#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:48,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {16812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16812#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:48,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16813#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:48,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {16813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16813#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:48,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {16813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16814#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:48,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {16814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16814#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:48,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {16814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16815#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:48,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {16815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16815#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:48,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {16815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16816#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:48,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {16816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16816#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:48,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {16816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16817#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:48,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {16817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16817#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:48,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {16817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16818#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:48,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {16818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16818#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:48,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {16818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16819#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:48,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {16819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16819#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:48,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {16819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16820#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:48,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {16820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16820#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:48,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {16820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16821#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:48,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {16821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16821#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:48,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {16821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16822#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:48,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {16822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16822#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:48,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {16822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16823#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:48,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {16823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16823#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:48,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {16823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16824#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:48,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {16824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16824#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:48,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {16824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16825#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:48,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {16825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16825#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:48,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16826#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:48,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {16826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16826#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:48,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {16826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16827#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:48,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {16827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16827#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:48,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {16827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16828#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:48,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:48,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16829#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:48,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {16829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:48,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {16829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16830#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:48,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {16830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:48,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {16830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16831#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:48,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {16831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:48,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {16831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16832#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:48,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {16832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:48,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {16832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16833#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:48,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {16833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:48,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {16833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16834#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:48,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {16834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:48,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {16834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16835#(<= main_~i~0 29)} is VALID [2022-04-15 05:46:48,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {16835#(<= main_~i~0 29)} assume !(~i~0 < 1024); {16802#false} is VALID [2022-04-15 05:46:48,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {16802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16802#false} is VALID [2022-04-15 05:46:48,145 INFO L272 TraceCheckUtils]: 66: Hoare triple {16802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {16802#false} is VALID [2022-04-15 05:46:48,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {16802#false} ~cond := #in~cond; {16802#false} is VALID [2022-04-15 05:46:48,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {16802#false} assume 0 == ~cond; {16802#false} is VALID [2022-04-15 05:46:48,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {16802#false} assume !false; {16802#false} is VALID [2022-04-15 05:46:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340171503] [2022-04-15 05:46:48,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340171503] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724011570] [2022-04-15 05:46:48,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:46:48,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:48,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:48,148 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:48,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 05:46:48,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:46:48,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:46:48,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 05:46:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:48,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:46:48,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {16801#true} call ULTIMATE.init(); {16801#true} is VALID [2022-04-15 05:46:48,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {16801#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(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-15 05:46:48,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-15 05:46:48,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-15 05:46:48,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {16801#true} call #t~ret6 := main(); {16801#true} is VALID [2022-04-15 05:46:48,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {16801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {16855#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:48,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {16855#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 0)} is VALID [2022-04-15 05:46:48,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {16855#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16807#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:48,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {16807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16807#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:48,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {16807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16808#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:48,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {16808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16808#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:48,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {16808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16809#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:48,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {16809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16809#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:48,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {16809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16810#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:48,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {16810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16810#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:48,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {16810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16811#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:48,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {16811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16811#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:48,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {16811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16812#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:48,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {16812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16812#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:48,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16813#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:48,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {16813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16813#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:48,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {16813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16814#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:48,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {16814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16814#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:48,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {16814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16815#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:48,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {16815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16815#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:48,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {16815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16816#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:48,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {16816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16816#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:48,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {16816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16817#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:48,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {16817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16817#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:48,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {16817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16818#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:48,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {16818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16818#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:48,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {16818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16819#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:48,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {16819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16819#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:48,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {16819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16820#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:48,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {16820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16820#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:48,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {16820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16821#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:48,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {16821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16821#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:48,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {16821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16822#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:48,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {16822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16822#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:48,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {16822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16823#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:48,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {16823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16823#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:48,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {16823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16824#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:48,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {16824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16824#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:48,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {16824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16825#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:48,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {16825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16825#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:48,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16826#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:48,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {16826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16826#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:48,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {16826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16827#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:48,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {16827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16827#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:48,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {16827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16828#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:48,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:48,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16829#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:48,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {16829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:48,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {16829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16830#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:48,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {16830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:48,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {16830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16831#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:48,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {16831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:48,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {16831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16832#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:48,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {16832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:48,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {16832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16833#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:48,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {16833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:48,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {16833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16834#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:48,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {16834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:48,685 INFO L290 TraceCheckUtils]: 63: Hoare triple {16834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16835#(<= main_~i~0 29)} is VALID [2022-04-15 05:46:48,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {16835#(<= main_~i~0 29)} assume !(~i~0 < 1024); {16802#false} is VALID [2022-04-15 05:46:48,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {16802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16802#false} is VALID [2022-04-15 05:46:48,686 INFO L272 TraceCheckUtils]: 66: Hoare triple {16802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {16802#false} is VALID [2022-04-15 05:46:48,686 INFO L290 TraceCheckUtils]: 67: Hoare triple {16802#false} ~cond := #in~cond; {16802#false} is VALID [2022-04-15 05:46:48,686 INFO L290 TraceCheckUtils]: 68: Hoare triple {16802#false} assume 0 == ~cond; {16802#false} is VALID [2022-04-15 05:46:48,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {16802#false} assume !false; {16802#false} is VALID [2022-04-15 05:46:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:48,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:46:49,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {16802#false} assume !false; {16802#false} is VALID [2022-04-15 05:46:49,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {16802#false} assume 0 == ~cond; {16802#false} is VALID [2022-04-15 05:46:49,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {16802#false} ~cond := #in~cond; {16802#false} is VALID [2022-04-15 05:46:49,920 INFO L272 TraceCheckUtils]: 66: Hoare triple {16802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {16802#false} is VALID [2022-04-15 05:46:49,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {16802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16802#false} is VALID [2022-04-15 05:46:49,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {17063#(< main_~i~0 1024)} assume !(~i~0 < 1024); {16802#false} is VALID [2022-04-15 05:46:49,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {17067#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17063#(< main_~i~0 1024)} is VALID [2022-04-15 05:46:49,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {17067#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17067#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:49,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {17074#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17067#(< main_~i~0 1023)} is VALID [2022-04-15 05:46:49,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {17074#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17074#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:49,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {17081#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17074#(< main_~i~0 1022)} is VALID [2022-04-15 05:46:49,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {17081#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17081#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:49,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {17088#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17081#(< main_~i~0 1021)} is VALID [2022-04-15 05:46:49,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {17088#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17088#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:49,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {17095#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17088#(< main_~i~0 1020)} is VALID [2022-04-15 05:46:49,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {17095#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17095#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:49,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {17102#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17095#(< main_~i~0 1019)} is VALID [2022-04-15 05:46:49,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {17102#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17102#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:49,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {17109#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17102#(< main_~i~0 1018)} is VALID [2022-04-15 05:46:49,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {17109#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17109#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:49,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {17116#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17109#(< main_~i~0 1017)} is VALID [2022-04-15 05:46:49,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {17116#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17116#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:49,926 INFO L290 TraceCheckUtils]: 47: Hoare triple {17123#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17116#(< main_~i~0 1016)} is VALID [2022-04-15 05:46:49,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {17123#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17123#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:49,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {17130#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17123#(< main_~i~0 1015)} is VALID [2022-04-15 05:46:49,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {17130#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17130#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:49,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {17137#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17130#(< main_~i~0 1014)} is VALID [2022-04-15 05:46:49,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {17137#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17137#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:49,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {17144#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17137#(< main_~i~0 1013)} is VALID [2022-04-15 05:46:49,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {17144#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17144#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:49,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {17151#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17144#(< main_~i~0 1012)} is VALID [2022-04-15 05:46:49,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {17151#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17151#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:49,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {17158#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17151#(< main_~i~0 1011)} is VALID [2022-04-15 05:46:49,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {17158#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17158#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:49,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {17165#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17158#(< main_~i~0 1010)} is VALID [2022-04-15 05:46:49,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {17165#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17165#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:49,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {17172#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17165#(< main_~i~0 1009)} is VALID [2022-04-15 05:46:49,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {17172#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17172#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:49,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {17179#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17172#(< main_~i~0 1008)} is VALID [2022-04-15 05:46:49,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {17179#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17179#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:49,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {17186#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17179#(< main_~i~0 1007)} is VALID [2022-04-15 05:46:49,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {17186#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17186#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:49,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {17193#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17186#(< main_~i~0 1006)} is VALID [2022-04-15 05:46:49,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {17193#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17193#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:49,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {17200#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17193#(< main_~i~0 1005)} is VALID [2022-04-15 05:46:49,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {17200#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17200#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:49,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {17207#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17200#(< main_~i~0 1004)} is VALID [2022-04-15 05:46:49,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {17207#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17207#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:49,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {17214#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17207#(< main_~i~0 1003)} is VALID [2022-04-15 05:46:49,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {17214#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17214#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:49,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {17221#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17214#(< main_~i~0 1002)} is VALID [2022-04-15 05:46:49,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {17221#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17221#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:49,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {17228#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17221#(< main_~i~0 1001)} is VALID [2022-04-15 05:46:49,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {17228#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17228#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:49,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {17235#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17228#(< main_~i~0 1000)} is VALID [2022-04-15 05:46:49,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {17235#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17235#(< main_~i~0 999)} is VALID [2022-04-15 05:46:49,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {17242#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17235#(< main_~i~0 999)} is VALID [2022-04-15 05:46:49,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {17242#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17242#(< main_~i~0 998)} is VALID [2022-04-15 05:46:49,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {17249#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17242#(< main_~i~0 998)} is VALID [2022-04-15 05:46:49,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {17249#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17249#(< main_~i~0 997)} is VALID [2022-04-15 05:46:49,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {17256#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17249#(< main_~i~0 997)} is VALID [2022-04-15 05:46:49,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {17256#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17256#(< main_~i~0 996)} is VALID [2022-04-15 05:46:49,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {17263#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17256#(< main_~i~0 996)} is VALID [2022-04-15 05:46:49,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {17263#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17263#(< main_~i~0 995)} is VALID [2022-04-15 05:46:49,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {16801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {17263#(< main_~i~0 995)} is VALID [2022-04-15 05:46:49,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {16801#true} call #t~ret6 := main(); {16801#true} is VALID [2022-04-15 05:46:49,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16801#true} {16801#true} #39#return; {16801#true} is VALID [2022-04-15 05:46:49,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {16801#true} assume true; {16801#true} is VALID [2022-04-15 05:46:49,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {16801#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(12, 2);call #Ultimate.allocInit(12, 3); {16801#true} is VALID [2022-04-15 05:46:49,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {16801#true} call ULTIMATE.init(); {16801#true} is VALID [2022-04-15 05:46:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724011570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:46:49,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:46:49,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 05:46:49,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:46:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113639746] [2022-04-15 05:46:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113639746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:46:49,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:46:49,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 05:46:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730187403] [2022-04-15 05:46:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:46:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 05:46:49,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:46:49,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:49,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:49,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 05:46:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 05:46:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 05:46:49,989 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:50,850 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 05:46:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 05:46:50,851 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 05:46:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:46:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 05:46:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 05:46:50,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-15 05:46:50,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:50,933 INFO L225 Difference]: With dead ends: 80 [2022-04-15 05:46:50,933 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 05:46:50,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 05:46:50,935 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:46:50,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 39 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:46:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 05:46:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-15 05:46:51,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:46:51,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:51,183 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:51,183 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:51,184 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 05:46:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 05:46:51,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:51,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:51,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 05:46:51,185 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 05:46:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:46:51,186 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 05:46:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 05:46:51,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:46:51,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:46:51,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:46:51,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:46:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-15 05:46:51,188 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2022-04-15 05:46:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:46:51,188 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-15 05:46:51,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:46:51,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-15 05:46:51,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:46:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-15 05:46:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 05:46:51,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:46:51,284 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:46:51,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 05:46:51,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:51,499 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:46:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:46:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1905476662, now seen corresponding path program 59 times [2022-04-15 05:46:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:46:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339355453] [2022-04-15 05:46:51,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:46:51,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:46:51,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:46:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1905476662, now seen corresponding path program 60 times [2022-04-15 05:46:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:46:51,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352451412] [2022-04-15 05:46:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:46:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:46:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:46:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:46:51,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {17837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-15 05:46:51,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-15 05:46:51,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-15 05:46:51,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {17801#true} call ULTIMATE.init(); {17837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:46:51,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {17837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-15 05:46:51,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-15 05:46:51,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-15 05:46:51,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {17801#true} call #t~ret6 := main(); {17801#true} is VALID [2022-04-15 05:46:51,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {17801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {17806#(= main_~i~0 0)} is VALID [2022-04-15 05:46:51,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {17806#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17806#(= main_~i~0 0)} is VALID [2022-04-15 05:46:51,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {17806#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17807#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:51,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {17807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17807#(<= main_~i~0 1)} is VALID [2022-04-15 05:46:51,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {17807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17808#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:51,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {17808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17808#(<= main_~i~0 2)} is VALID [2022-04-15 05:46:51,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {17808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17809#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:51,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {17809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17809#(<= main_~i~0 3)} is VALID [2022-04-15 05:46:51,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {17809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17810#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:51,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {17810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17810#(<= main_~i~0 4)} is VALID [2022-04-15 05:46:51,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {17810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17811#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:51,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {17811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17811#(<= main_~i~0 5)} is VALID [2022-04-15 05:46:51,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {17811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17812#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:51,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {17812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17812#(<= main_~i~0 6)} is VALID [2022-04-15 05:46:51,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {17812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17813#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:51,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17813#(<= main_~i~0 7)} is VALID [2022-04-15 05:46:51,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17814#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:51,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {17814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17814#(<= main_~i~0 8)} is VALID [2022-04-15 05:46:51,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {17814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17815#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:51,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {17815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17815#(<= main_~i~0 9)} is VALID [2022-04-15 05:46:51,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {17815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17816#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:51,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {17816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17816#(<= main_~i~0 10)} is VALID [2022-04-15 05:46:51,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {17816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17817#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:51,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {17817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17817#(<= main_~i~0 11)} is VALID [2022-04-15 05:46:51,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {17817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17818#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:51,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {17818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17818#(<= main_~i~0 12)} is VALID [2022-04-15 05:46:51,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {17818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17819#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:51,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {17819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17819#(<= main_~i~0 13)} is VALID [2022-04-15 05:46:51,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {17819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17820#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:51,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {17820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17820#(<= main_~i~0 14)} is VALID [2022-04-15 05:46:51,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {17820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17821#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:51,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {17821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17821#(<= main_~i~0 15)} is VALID [2022-04-15 05:46:51,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {17821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17822#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:51,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {17822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17822#(<= main_~i~0 16)} is VALID [2022-04-15 05:46:51,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {17822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17823#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:51,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {17823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17823#(<= main_~i~0 17)} is VALID [2022-04-15 05:46:51,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {17823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17824#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:51,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {17824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17824#(<= main_~i~0 18)} is VALID [2022-04-15 05:46:51,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {17824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17825#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:51,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {17825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17825#(<= main_~i~0 19)} is VALID [2022-04-15 05:46:51,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {17825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17826#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:51,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {17826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17826#(<= main_~i~0 20)} is VALID [2022-04-15 05:46:51,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {17826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17827#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:51,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {17827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17827#(<= main_~i~0 21)} is VALID [2022-04-15 05:46:51,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {17827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17828#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:51,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {17828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17828#(<= main_~i~0 22)} is VALID [2022-04-15 05:46:51,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {17828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17829#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:51,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {17829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17829#(<= main_~i~0 23)} is VALID [2022-04-15 05:46:51,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {17829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17830#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:51,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {17830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17830#(<= main_~i~0 24)} is VALID [2022-04-15 05:46:51,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {17830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17831#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:51,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {17831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17831#(<= main_~i~0 25)} is VALID [2022-04-15 05:46:51,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {17831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17832#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:51,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {17832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17832#(<= main_~i~0 26)} is VALID [2022-04-15 05:46:51,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {17832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17833#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:51,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {17833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17833#(<= main_~i~0 27)} is VALID [2022-04-15 05:46:51,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {17833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17834#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:51,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {17834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17834#(<= main_~i~0 28)} is VALID [2022-04-15 05:46:51,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {17834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17835#(<= main_~i~0 29)} is VALID [2022-04-15 05:46:51,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {17835#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17835#(<= main_~i~0 29)} is VALID [2022-04-15 05:46:51,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {17835#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17836#(<= main_~i~0 30)} is VALID [2022-04-15 05:46:51,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {17836#(<= main_~i~0 30)} assume !(~i~0 < 1024); {17802#false} is VALID [2022-04-15 05:46:51,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {17802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17802#false} is VALID [2022-04-15 05:46:51,984 INFO L272 TraceCheckUtils]: 68: Hoare triple {17802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {17802#false} is VALID [2022-04-15 05:46:51,984 INFO L290 TraceCheckUtils]: 69: Hoare triple {17802#false} ~cond := #in~cond; {17802#false} is VALID [2022-04-15 05:46:51,984 INFO L290 TraceCheckUtils]: 70: Hoare triple {17802#false} assume 0 == ~cond; {17802#false} is VALID [2022-04-15 05:46:51,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {17802#false} assume !false; {17802#false} is VALID [2022-04-15 05:46:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:46:51,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:46:51,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352451412] [2022-04-15 05:46:51,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352451412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:46:51,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033013046] [2022-04-15 05:46:51,985 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:46:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:46:51,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:46:51,987 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:46:51,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 05:47:00,694 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-15 05:47:00,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:00,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 05:47:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:01,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {17801#true} call ULTIMATE.init(); {17801#true} is VALID [2022-04-15 05:47:01,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {17801#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(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-15 05:47:01,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-15 05:47:01,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-15 05:47:01,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {17801#true} call #t~ret6 := main(); {17801#true} is VALID [2022-04-15 05:47:01,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {17801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {17856#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:01,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {17856#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17856#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:01,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {17856#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17807#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:01,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {17807#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17807#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:01,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {17807#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17808#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:01,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {17808#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17808#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:01,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {17808#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17809#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:01,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {17809#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17809#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:01,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {17809#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17810#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:01,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {17810#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17810#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:01,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {17810#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17811#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:01,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {17811#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17811#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:01,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {17811#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17812#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:01,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {17812#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17812#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:01,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {17812#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17813#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:01,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17813#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:01,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17814#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:01,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {17814#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17814#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:01,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {17814#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17815#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:01,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {17815#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17815#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:01,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {17815#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17816#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:01,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {17816#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17816#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:01,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {17816#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17817#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:01,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {17817#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17817#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:01,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {17817#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17818#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:01,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {17818#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17818#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:01,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {17818#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17819#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:01,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {17819#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17819#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:01,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {17819#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17820#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:01,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {17820#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17820#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:01,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {17820#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17821#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:01,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {17821#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17821#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:01,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {17821#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17822#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:01,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {17822#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17822#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:01,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {17822#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17823#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:01,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {17823#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17823#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:01,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {17823#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17824#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:01,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {17824#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17824#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:01,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {17824#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17825#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:01,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {17825#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17825#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:01,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {17825#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17826#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:01,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {17826#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17826#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:01,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {17826#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17827#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:01,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {17827#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17827#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:01,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {17827#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17828#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:01,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {17828#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17828#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:01,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {17828#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17829#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:01,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {17829#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17829#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:01,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {17829#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17830#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:01,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {17830#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17830#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:01,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {17830#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17831#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:01,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {17831#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17831#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:01,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {17831#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17832#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:01,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {17832#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17832#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:01,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {17832#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17833#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:01,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {17833#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17833#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:01,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {17833#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17834#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:01,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {17834#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17834#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:01,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {17834#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17835#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:01,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {17835#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17835#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:01,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {17835#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17836#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:01,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {17836#(<= main_~i~0 30)} assume !(~i~0 < 1024); {17802#false} is VALID [2022-04-15 05:47:01,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {17802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17802#false} is VALID [2022-04-15 05:47:01,168 INFO L272 TraceCheckUtils]: 68: Hoare triple {17802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {17802#false} is VALID [2022-04-15 05:47:01,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {17802#false} ~cond := #in~cond; {17802#false} is VALID [2022-04-15 05:47:01,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {17802#false} assume 0 == ~cond; {17802#false} is VALID [2022-04-15 05:47:01,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {17802#false} assume !false; {17802#false} is VALID [2022-04-15 05:47:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:01,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:02,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {17802#false} assume !false; {17802#false} is VALID [2022-04-15 05:47:02,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {17802#false} assume 0 == ~cond; {17802#false} is VALID [2022-04-15 05:47:02,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {17802#false} ~cond := #in~cond; {17802#false} is VALID [2022-04-15 05:47:02,468 INFO L272 TraceCheckUtils]: 68: Hoare triple {17802#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {17802#false} is VALID [2022-04-15 05:47:02,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {17802#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17802#false} is VALID [2022-04-15 05:47:02,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {18070#(< main_~i~0 1024)} assume !(~i~0 < 1024); {17802#false} is VALID [2022-04-15 05:47:02,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {18074#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18070#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:02,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {18074#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18074#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:02,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {18081#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18074#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:02,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {18081#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18081#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:02,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {18088#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18081#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:02,474 INFO L290 TraceCheckUtils]: 60: Hoare triple {18088#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18088#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:02,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {18095#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18088#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:02,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {18095#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18095#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:02,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {18102#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18095#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:02,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {18102#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18102#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:02,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {18109#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18102#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:02,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {18109#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18109#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:02,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {18116#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18109#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:02,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {18116#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18116#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:02,477 INFO L290 TraceCheckUtils]: 51: Hoare triple {18123#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18116#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:02,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {18123#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18123#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:02,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {18130#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18123#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:02,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {18130#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18130#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:02,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {18137#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18130#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:02,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {18137#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18137#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:02,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {18144#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18137#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:02,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {18144#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18144#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:02,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {18151#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:02,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {18151#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18151#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:02,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {18158#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18151#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:02,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {18158#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18158#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:02,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {18165#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18158#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:02,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {18165#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18165#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:02,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {18172#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18165#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:02,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {18172#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18172#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:02,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {18179#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18172#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:02,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {18179#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18179#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:02,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {18186#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18179#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:02,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {18186#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18186#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:02,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {18193#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18186#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:02,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {18193#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18193#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:02,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {18200#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18193#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:02,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {18200#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18200#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:02,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {18207#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18200#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:02,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {18207#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18207#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:02,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {18214#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18207#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:02,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {18214#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18214#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:02,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {18221#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18214#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:02,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {18221#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18221#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:02,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {18228#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18221#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:02,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {18228#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18228#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:02,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {18235#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18228#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:02,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {18235#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18235#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:02,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {18242#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18235#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:02,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {18242#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18242#(< main_~i~0 999)} is VALID [2022-04-15 05:47:02,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {18249#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18242#(< main_~i~0 999)} is VALID [2022-04-15 05:47:02,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {18249#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18249#(< main_~i~0 998)} is VALID [2022-04-15 05:47:02,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {18256#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18249#(< main_~i~0 998)} is VALID [2022-04-15 05:47:02,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {18256#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18256#(< main_~i~0 997)} is VALID [2022-04-15 05:47:02,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {18263#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18256#(< main_~i~0 997)} is VALID [2022-04-15 05:47:02,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {18263#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18263#(< main_~i~0 996)} is VALID [2022-04-15 05:47:02,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {18270#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18263#(< main_~i~0 996)} is VALID [2022-04-15 05:47:02,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {18270#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18270#(< main_~i~0 995)} is VALID [2022-04-15 05:47:02,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {18277#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18270#(< main_~i~0 995)} is VALID [2022-04-15 05:47:02,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {18277#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18277#(< main_~i~0 994)} is VALID [2022-04-15 05:47:02,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {17801#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {18277#(< main_~i~0 994)} is VALID [2022-04-15 05:47:02,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {17801#true} call #t~ret6 := main(); {17801#true} is VALID [2022-04-15 05:47:02,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17801#true} {17801#true} #39#return; {17801#true} is VALID [2022-04-15 05:47:02,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {17801#true} assume true; {17801#true} is VALID [2022-04-15 05:47:02,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {17801#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(12, 2);call #Ultimate.allocInit(12, 3); {17801#true} is VALID [2022-04-15 05:47:02,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {17801#true} call ULTIMATE.init(); {17801#true} is VALID [2022-04-15 05:47:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:02,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033013046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:02,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:02,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-15 05:47:02,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:02,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339355453] [2022-04-15 05:47:02,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339355453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:02,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:02,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 05:47:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988541788] [2022-04-15 05:47:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 05:47:02,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:02,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:02,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:02,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 05:47:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 05:47:02,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 05:47:02,561 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:03,442 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 05:47:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 05:47:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 05:47:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-15 05:47:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-15 05:47:03,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 82 transitions. [2022-04-15 05:47:03,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:03,503 INFO L225 Difference]: With dead ends: 82 [2022-04-15 05:47:03,503 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 05:47:03,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 05:47:03,504 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:03,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 19 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 05:47:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-04-15 05:47:03,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:03,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,719 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,719 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:03,720 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 05:47:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 05:47:03,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:03,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:03,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 05:47:03,721 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 05:47:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:03,721 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 05:47:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 05:47:03,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:03,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:03,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:03,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-15 05:47:03,723 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2022-04-15 05:47:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:03,731 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-15 05:47:03,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:03,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-15 05:47:03,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 05:47:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 05:47:03,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:47:03,833 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:47:03,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 05:47:04,052 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 05:47:04,052 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:47:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:47:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 632916536, now seen corresponding path program 61 times [2022-04-15 05:47:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:04,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261259613] [2022-04-15 05:47:04,055 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:47:04,055 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:47:04,055 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:47:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 632916536, now seen corresponding path program 62 times [2022-04-15 05:47:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:47:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892703831] [2022-04-15 05:47:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:47:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:47:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:47:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:04,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {18866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-15 05:47:04,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-15 05:47:04,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-15 05:47:04,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {18829#true} call ULTIMATE.init(); {18866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:47:04,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {18866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-15 05:47:04,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-15 05:47:04,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-15 05:47:04,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {18829#true} call #t~ret6 := main(); {18829#true} is VALID [2022-04-15 05:47:04,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {18829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {18834#(= main_~i~0 0)} is VALID [2022-04-15 05:47:04,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {18834#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18834#(= main_~i~0 0)} is VALID [2022-04-15 05:47:04,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {18834#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18835#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:04,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {18835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18835#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:04,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {18835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18836#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:04,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {18836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18836#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:04,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {18836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18837#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:04,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {18837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18837#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:04,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {18837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18838#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:04,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {18838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18838#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:04,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {18838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18839#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:04,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {18839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18839#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:04,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {18839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18840#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:04,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {18840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18840#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:04,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {18840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18841#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:04,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {18841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18841#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:04,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {18841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18842#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:04,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {18842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18842#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:04,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {18842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18843#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:04,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {18843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18843#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:04,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {18843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18844#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:04,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {18844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18844#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:04,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {18844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18845#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:04,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {18845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18845#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:04,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {18845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18846#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:04,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {18846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18846#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:04,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {18846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18847#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:04,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {18847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18847#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:04,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {18847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18848#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:04,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {18848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18848#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:04,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {18848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18849#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:04,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {18849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18849#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:04,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {18849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18850#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:04,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {18850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18850#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:04,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {18850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18851#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:04,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {18851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18851#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:04,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {18851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18852#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:04,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {18852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18852#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:04,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {18852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18853#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:04,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {18853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18853#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:04,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {18853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18854#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:04,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {18854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18854#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:04,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {18854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18855#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:04,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {18855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18855#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:04,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {18855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18856#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:04,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {18856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18856#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:04,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {18856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18857#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:04,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {18857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18857#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:04,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {18857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18858#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:04,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {18858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18858#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:04,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {18858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18859#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:04,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {18859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18859#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:04,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {18859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18860#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:04,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {18860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18860#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:04,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {18860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18861#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:04,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {18861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18861#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:04,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {18861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18862#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:04,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {18862#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18862#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:04,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {18862#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18863#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:04,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {18863#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18863#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:04,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {18863#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18864#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:04,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {18864#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18864#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:04,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {18864#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18865#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:04,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {18865#(<= main_~i~0 31)} assume !(~i~0 < 1024); {18830#false} is VALID [2022-04-15 05:47:04,616 INFO L290 TraceCheckUtils]: 69: Hoare triple {18830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18830#false} is VALID [2022-04-15 05:47:04,616 INFO L272 TraceCheckUtils]: 70: Hoare triple {18830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {18830#false} is VALID [2022-04-15 05:47:04,616 INFO L290 TraceCheckUtils]: 71: Hoare triple {18830#false} ~cond := #in~cond; {18830#false} is VALID [2022-04-15 05:47:04,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {18830#false} assume 0 == ~cond; {18830#false} is VALID [2022-04-15 05:47:04,616 INFO L290 TraceCheckUtils]: 73: Hoare triple {18830#false} assume !false; {18830#false} is VALID [2022-04-15 05:47:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:47:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892703831] [2022-04-15 05:47:04,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892703831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:47:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472067024] [2022-04-15 05:47:04,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:47:04,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:04,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:47:04,619 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:47:04,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 05:47:04,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:47:04,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:04,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:47:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:04,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:05,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {18829#true} call ULTIMATE.init(); {18829#true} is VALID [2022-04-15 05:47:05,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {18829#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(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-15 05:47:05,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-15 05:47:05,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-15 05:47:05,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {18829#true} call #t~ret6 := main(); {18829#true} is VALID [2022-04-15 05:47:05,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {18829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {18885#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:05,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {18885#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18885#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:05,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {18885#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18835#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:05,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {18835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18835#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:05,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {18835#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18836#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:05,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {18836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18836#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:05,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {18836#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18837#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:05,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {18837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18837#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:05,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {18837#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18838#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:05,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {18838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18838#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:05,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {18838#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18839#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:05,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {18839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18839#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:05,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {18839#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18840#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:05,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {18840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18840#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:05,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {18840#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18841#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:05,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {18841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18841#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:05,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {18841#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18842#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:05,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {18842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18842#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:05,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {18842#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18843#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:05,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {18843#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18843#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:05,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {18843#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18844#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:05,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {18844#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18844#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:05,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {18844#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18845#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:05,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {18845#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18845#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:05,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {18845#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18846#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:05,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {18846#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18846#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:05,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {18846#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18847#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:05,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {18847#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18847#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:05,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {18847#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18848#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:05,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {18848#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18848#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:05,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {18848#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18849#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:05,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {18849#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18849#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:05,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {18849#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18850#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:05,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {18850#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18850#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:05,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {18850#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18851#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:05,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {18851#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18851#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:05,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {18851#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18852#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:05,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {18852#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18852#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:05,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {18852#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18853#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:05,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {18853#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18853#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:05,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {18853#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18854#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:05,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {18854#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18854#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:05,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {18854#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18855#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:05,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {18855#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18855#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:05,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {18855#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18856#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:05,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {18856#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18856#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:05,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {18856#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18857#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:05,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {18857#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18857#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:05,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {18857#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18858#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:05,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {18858#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18858#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:05,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {18858#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18859#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:05,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {18859#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18859#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:05,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {18859#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18860#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:05,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {18860#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18860#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:05,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {18860#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18861#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:05,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {18861#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18861#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:05,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {18861#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18862#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:05,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {18862#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18862#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:05,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {18862#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18863#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:05,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {18863#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18863#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:05,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {18863#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18864#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:05,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {18864#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18864#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:05,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {18864#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18865#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:05,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {18865#(<= main_~i~0 31)} assume !(~i~0 < 1024); {18830#false} is VALID [2022-04-15 05:47:05,233 INFO L290 TraceCheckUtils]: 69: Hoare triple {18830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18830#false} is VALID [2022-04-15 05:47:05,233 INFO L272 TraceCheckUtils]: 70: Hoare triple {18830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {18830#false} is VALID [2022-04-15 05:47:05,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {18830#false} ~cond := #in~cond; {18830#false} is VALID [2022-04-15 05:47:05,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {18830#false} assume 0 == ~cond; {18830#false} is VALID [2022-04-15 05:47:05,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {18830#false} assume !false; {18830#false} is VALID [2022-04-15 05:47:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:05,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:06,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {18830#false} assume !false; {18830#false} is VALID [2022-04-15 05:47:06,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {18830#false} assume 0 == ~cond; {18830#false} is VALID [2022-04-15 05:47:06,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {18830#false} ~cond := #in~cond; {18830#false} is VALID [2022-04-15 05:47:06,589 INFO L272 TraceCheckUtils]: 70: Hoare triple {18830#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {18830#false} is VALID [2022-04-15 05:47:06,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {18830#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18830#false} is VALID [2022-04-15 05:47:06,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {19105#(< main_~i~0 1024)} assume !(~i~0 < 1024); {18830#false} is VALID [2022-04-15 05:47:06,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {19109#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19105#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:06,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {19109#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19109#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:06,590 INFO L290 TraceCheckUtils]: 65: Hoare triple {19116#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19109#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:06,590 INFO L290 TraceCheckUtils]: 64: Hoare triple {19116#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19116#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:06,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {19123#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19116#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:06,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {19123#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19123#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:06,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {19130#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19123#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:06,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {19130#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19130#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:06,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {19137#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19130#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:06,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {19137#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19137#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:06,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {19144#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19137#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:06,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {19144#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19144#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:06,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {19151#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19144#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:06,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {19151#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19151#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:06,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {19158#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19151#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:06,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {19158#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19158#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:06,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {19165#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19158#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:06,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {19165#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19165#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:06,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {19172#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19165#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:06,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {19172#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19172#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:06,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {19179#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19172#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:06,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {19179#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19179#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:06,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {19186#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19179#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:06,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {19186#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19186#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:06,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {19193#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19186#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:06,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {19193#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19193#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:06,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {19200#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19193#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:06,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {19200#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19200#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:06,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {19207#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19200#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:06,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {19207#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19207#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:06,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {19214#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19207#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:06,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {19214#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19214#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:06,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {19221#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19214#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:06,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {19221#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19221#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:06,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {19228#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19221#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:06,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {19228#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19228#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:06,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {19235#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19228#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:06,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {19235#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19235#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:06,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {19242#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19235#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:06,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {19242#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19242#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:06,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {19249#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19242#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:06,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {19249#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19249#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:06,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {19256#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19249#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:06,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {19256#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19256#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:06,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {19263#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19256#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:06,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {19263#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19263#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:06,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {19270#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19263#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:06,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {19270#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19270#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:06,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {19277#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19270#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:06,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {19277#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19277#(< main_~i~0 999)} is VALID [2022-04-15 05:47:06,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {19284#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19277#(< main_~i~0 999)} is VALID [2022-04-15 05:47:06,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {19284#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19284#(< main_~i~0 998)} is VALID [2022-04-15 05:47:06,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {19291#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19284#(< main_~i~0 998)} is VALID [2022-04-15 05:47:06,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {19291#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19291#(< main_~i~0 997)} is VALID [2022-04-15 05:47:06,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {19298#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19291#(< main_~i~0 997)} is VALID [2022-04-15 05:47:06,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {19298#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19298#(< main_~i~0 996)} is VALID [2022-04-15 05:47:06,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {19305#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19298#(< main_~i~0 996)} is VALID [2022-04-15 05:47:06,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {19305#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19305#(< main_~i~0 995)} is VALID [2022-04-15 05:47:06,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {19312#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19305#(< main_~i~0 995)} is VALID [2022-04-15 05:47:06,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {19312#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19312#(< main_~i~0 994)} is VALID [2022-04-15 05:47:06,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {19319#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19312#(< main_~i~0 994)} is VALID [2022-04-15 05:47:06,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {19319#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19319#(< main_~i~0 993)} is VALID [2022-04-15 05:47:06,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {18829#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {19319#(< main_~i~0 993)} is VALID [2022-04-15 05:47:06,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {18829#true} call #t~ret6 := main(); {18829#true} is VALID [2022-04-15 05:47:06,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18829#true} {18829#true} #39#return; {18829#true} is VALID [2022-04-15 05:47:06,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {18829#true} assume true; {18829#true} is VALID [2022-04-15 05:47:06,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {18829#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(12, 2);call #Ultimate.allocInit(12, 3); {18829#true} is VALID [2022-04-15 05:47:06,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {18829#true} call ULTIMATE.init(); {18829#true} is VALID [2022-04-15 05:47:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472067024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:06,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:06,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 05:47:06,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261259613] [2022-04-15 05:47:06,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261259613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:06,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:06,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 05:47:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722364444] [2022-04-15 05:47:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 05:47:06,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:06,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:06,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:06,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 05:47:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 05:47:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 05:47:06,672 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:07,591 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-15 05:47:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 05:47:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 05:47:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-15 05:47:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-15 05:47:07,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 84 transitions. [2022-04-15 05:47:07,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:07,677 INFO L225 Difference]: With dead ends: 84 [2022-04-15 05:47:07,677 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 05:47:07,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 05:47:07,679 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:07,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 24 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 05:47:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-04-15 05:47:07,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:07,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,966 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,966 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:07,967 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 05:47:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 05:47:07,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:07,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:07,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 05:47:07,967 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 05:47:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:07,968 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 05:47:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 05:47:07,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:07,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:07,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:07,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-15 05:47:07,970 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2022-04-15 05:47:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:07,970 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-15 05:47:07,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:07,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-15 05:47:08,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-15 05:47:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 05:47:08,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:47:08,052 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:47:08,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 05:47:08,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:08,259 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:47:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:47:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1768314810, now seen corresponding path program 63 times [2022-04-15 05:47:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449489593] [2022-04-15 05:47:08,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:47:08,262 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:47:08,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:47:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1768314810, now seen corresponding path program 64 times [2022-04-15 05:47:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:47:08,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105239952] [2022-04-15 05:47:08,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:47:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:47:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:47:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:08,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {19923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-15 05:47:08,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-15 05:47:08,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-15 05:47:08,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {19885#true} call ULTIMATE.init(); {19923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:47:08,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {19923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-15 05:47:08,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-15 05:47:08,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-15 05:47:08,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {19885#true} call #t~ret6 := main(); {19885#true} is VALID [2022-04-15 05:47:08,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {19885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {19890#(= main_~i~0 0)} is VALID [2022-04-15 05:47:08,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {19890#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19890#(= main_~i~0 0)} is VALID [2022-04-15 05:47:08,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {19890#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19891#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:08,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {19891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19891#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:08,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {19891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19892#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:08,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {19892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19892#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:08,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {19892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19893#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:08,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {19893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19893#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:08,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {19893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19894#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:08,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {19894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19894#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:08,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {19894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19895#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:08,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {19895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19895#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:08,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {19895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19896#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:08,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {19896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19896#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:08,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {19896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19897#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:08,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {19897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19897#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:08,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {19897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19898#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:08,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {19898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19898#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:08,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {19898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19899#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:08,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {19899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19899#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:08,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {19899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19900#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:08,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {19900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19900#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:08,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {19900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19901#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:08,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {19901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19901#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:08,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {19901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19902#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:08,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {19902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19902#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:08,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {19902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19903#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:08,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {19903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19903#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:08,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {19903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19904#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:08,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {19904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19904#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:08,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {19904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19905#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:08,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {19905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19905#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:08,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {19905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19906#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:08,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {19906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19906#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:08,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {19906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19907#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:08,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {19907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19907#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:08,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {19907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19908#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:08,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {19908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19908#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:08,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {19908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19909#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:08,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {19909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19909#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:08,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {19909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19910#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:08,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {19910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19910#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:08,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {19910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19911#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:08,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {19911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19911#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:08,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {19911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19912#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:08,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {19912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19912#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:08,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {19912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19913#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:08,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {19913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19913#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:08,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {19913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19914#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:08,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {19914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19914#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:08,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {19914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19915#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:08,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {19915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19915#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:08,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {19915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19916#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:08,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {19916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19916#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:08,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {19916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19917#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:08,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {19917#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19917#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:08,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {19917#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19918#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:08,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {19918#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19918#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:08,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {19918#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19919#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:08,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {19919#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19919#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:08,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {19919#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19920#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:08,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {19920#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19920#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:08,801 INFO L290 TraceCheckUtils]: 67: Hoare triple {19920#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19921#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:08,801 INFO L290 TraceCheckUtils]: 68: Hoare triple {19921#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19921#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:08,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {19921#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19922#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:08,802 INFO L290 TraceCheckUtils]: 70: Hoare triple {19922#(<= main_~i~0 32)} assume !(~i~0 < 1024); {19886#false} is VALID [2022-04-15 05:47:08,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {19886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19886#false} is VALID [2022-04-15 05:47:08,802 INFO L272 TraceCheckUtils]: 72: Hoare triple {19886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {19886#false} is VALID [2022-04-15 05:47:08,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {19886#false} ~cond := #in~cond; {19886#false} is VALID [2022-04-15 05:47:08,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {19886#false} assume 0 == ~cond; {19886#false} is VALID [2022-04-15 05:47:08,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {19886#false} assume !false; {19886#false} is VALID [2022-04-15 05:47:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:47:08,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105239952] [2022-04-15 05:47:08,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105239952] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:47:08,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269883516] [2022-04-15 05:47:08,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:47:08,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:08,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:47:08,808 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:47:08,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 05:47:08,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:47:08,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:08,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 05:47:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:09,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:09,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {19885#true} call ULTIMATE.init(); {19885#true} is VALID [2022-04-15 05:47:09,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {19885#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(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-15 05:47:09,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-15 05:47:09,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-15 05:47:09,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {19885#true} call #t~ret6 := main(); {19885#true} is VALID [2022-04-15 05:47:09,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {19885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {19942#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:09,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {19942#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19942#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:09,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {19942#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19891#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:09,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {19891#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19891#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:09,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {19891#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19892#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:09,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {19892#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19892#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:09,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {19892#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19893#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:09,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {19893#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19893#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:09,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {19893#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19894#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:09,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {19894#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19894#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:09,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {19894#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19895#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:09,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {19895#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19895#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:09,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {19895#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19896#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:09,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {19896#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19896#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:09,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {19896#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19897#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:09,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {19897#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19897#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:09,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {19897#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19898#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:09,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {19898#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19898#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:09,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {19898#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19899#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:09,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {19899#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19899#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:09,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {19899#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19900#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:09,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {19900#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19900#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:09,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {19900#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19901#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:09,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {19901#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19901#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:09,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {19901#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19902#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:09,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {19902#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19902#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:09,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {19902#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19903#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:09,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {19903#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19903#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:09,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {19903#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19904#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:09,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {19904#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19904#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:09,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {19904#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19905#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:09,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {19905#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19905#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:09,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {19905#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19906#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:09,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {19906#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19906#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:09,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {19906#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19907#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:09,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {19907#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19907#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:09,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {19907#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19908#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:09,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {19908#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19908#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:09,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {19908#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19909#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:09,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {19909#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19909#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:09,470 INFO L290 TraceCheckUtils]: 45: Hoare triple {19909#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19910#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:09,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {19910#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19910#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:09,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {19910#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19911#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:09,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {19911#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19911#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:09,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {19911#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19912#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:09,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {19912#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19912#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:09,472 INFO L290 TraceCheckUtils]: 51: Hoare triple {19912#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19913#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:09,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {19913#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19913#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:09,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {19913#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19914#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:09,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {19914#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19914#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:09,473 INFO L290 TraceCheckUtils]: 55: Hoare triple {19914#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19915#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:09,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {19915#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19915#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:09,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {19915#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19916#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:09,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {19916#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19916#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:09,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {19916#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19917#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:09,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {19917#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19917#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:09,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {19917#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19918#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:09,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {19918#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19918#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:09,476 INFO L290 TraceCheckUtils]: 63: Hoare triple {19918#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19919#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:09,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {19919#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19919#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:09,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {19919#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19920#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:09,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {19920#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19920#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:09,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {19920#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19921#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:09,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {19921#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19921#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:09,477 INFO L290 TraceCheckUtils]: 69: Hoare triple {19921#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19922#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:09,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {19922#(<= main_~i~0 32)} assume !(~i~0 < 1024); {19886#false} is VALID [2022-04-15 05:47:09,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {19886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19886#false} is VALID [2022-04-15 05:47:09,478 INFO L272 TraceCheckUtils]: 72: Hoare triple {19886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {19886#false} is VALID [2022-04-15 05:47:09,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {19886#false} ~cond := #in~cond; {19886#false} is VALID [2022-04-15 05:47:09,478 INFO L290 TraceCheckUtils]: 74: Hoare triple {19886#false} assume 0 == ~cond; {19886#false} is VALID [2022-04-15 05:47:09,478 INFO L290 TraceCheckUtils]: 75: Hoare triple {19886#false} assume !false; {19886#false} is VALID [2022-04-15 05:47:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:09,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:10,909 INFO L290 TraceCheckUtils]: 75: Hoare triple {19886#false} assume !false; {19886#false} is VALID [2022-04-15 05:47:10,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {19886#false} assume 0 == ~cond; {19886#false} is VALID [2022-04-15 05:47:10,910 INFO L290 TraceCheckUtils]: 73: Hoare triple {19886#false} ~cond := #in~cond; {19886#false} is VALID [2022-04-15 05:47:10,910 INFO L272 TraceCheckUtils]: 72: Hoare triple {19886#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {19886#false} is VALID [2022-04-15 05:47:10,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {19886#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19886#false} is VALID [2022-04-15 05:47:10,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {20168#(< main_~i~0 1024)} assume !(~i~0 < 1024); {19886#false} is VALID [2022-04-15 05:47:10,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {20172#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20168#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:10,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {20172#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20172#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:10,911 INFO L290 TraceCheckUtils]: 67: Hoare triple {20179#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20172#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:10,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {20179#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20179#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:10,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {20186#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20179#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:10,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {20186#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20186#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:10,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {20193#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20186#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:10,913 INFO L290 TraceCheckUtils]: 62: Hoare triple {20193#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20193#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:10,913 INFO L290 TraceCheckUtils]: 61: Hoare triple {20200#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20193#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:10,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {20200#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20200#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:10,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {20207#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20200#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:10,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {20207#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20207#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:10,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {20214#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20207#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:10,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {20214#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20214#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:10,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {20221#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20214#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:10,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {20221#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20221#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:10,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {20228#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20221#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:10,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {20228#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20228#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:10,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {20235#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20228#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:10,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {20235#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20235#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:10,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {20242#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20235#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:10,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {20242#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20242#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:10,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {20249#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20242#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:10,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {20249#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20249#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:10,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {20256#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20249#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:10,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {20256#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20256#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:10,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {20263#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20256#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:10,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {20263#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20263#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:10,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {20270#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20263#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:10,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {20270#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20270#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:10,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {20277#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20270#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:10,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {20277#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20277#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:10,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {20284#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20277#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:10,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {20284#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20284#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:10,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {20291#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20284#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:10,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {20291#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20291#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:10,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {20298#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20291#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:10,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {20298#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20298#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:10,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {20305#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20298#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:10,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {20305#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20305#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:10,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {20312#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20305#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:10,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {20312#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20312#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:10,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {20319#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20312#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:10,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {20319#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20319#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:10,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {20326#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20319#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:10,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {20326#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20326#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:10,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {20333#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20326#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:10,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {20333#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20333#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:10,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {20340#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20333#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:10,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {20340#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20340#(< main_~i~0 999)} is VALID [2022-04-15 05:47:10,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {20347#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20340#(< main_~i~0 999)} is VALID [2022-04-15 05:47:10,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {20347#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20347#(< main_~i~0 998)} is VALID [2022-04-15 05:47:10,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {20354#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20347#(< main_~i~0 998)} is VALID [2022-04-15 05:47:10,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {20354#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20354#(< main_~i~0 997)} is VALID [2022-04-15 05:47:10,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {20361#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20354#(< main_~i~0 997)} is VALID [2022-04-15 05:47:10,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {20361#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20361#(< main_~i~0 996)} is VALID [2022-04-15 05:47:10,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {20368#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20361#(< main_~i~0 996)} is VALID [2022-04-15 05:47:10,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {20368#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20368#(< main_~i~0 995)} is VALID [2022-04-15 05:47:10,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {20375#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20368#(< main_~i~0 995)} is VALID [2022-04-15 05:47:10,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {20375#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20375#(< main_~i~0 994)} is VALID [2022-04-15 05:47:10,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {20382#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20375#(< main_~i~0 994)} is VALID [2022-04-15 05:47:10,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {20382#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20382#(< main_~i~0 993)} is VALID [2022-04-15 05:47:10,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {20389#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20382#(< main_~i~0 993)} is VALID [2022-04-15 05:47:10,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {20389#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20389#(< main_~i~0 992)} is VALID [2022-04-15 05:47:10,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {19885#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {20389#(< main_~i~0 992)} is VALID [2022-04-15 05:47:10,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {19885#true} call #t~ret6 := main(); {19885#true} is VALID [2022-04-15 05:47:10,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19885#true} {19885#true} #39#return; {19885#true} is VALID [2022-04-15 05:47:10,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {19885#true} assume true; {19885#true} is VALID [2022-04-15 05:47:10,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {19885#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(12, 2);call #Ultimate.allocInit(12, 3); {19885#true} is VALID [2022-04-15 05:47:10,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {19885#true} call ULTIMATE.init(); {19885#true} is VALID [2022-04-15 05:47:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:10,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269883516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:10,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:10,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-15 05:47:10,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:10,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449489593] [2022-04-15 05:47:10,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449489593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:10,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:10,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 05:47:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965307955] [2022-04-15 05:47:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 05:47:10,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:10,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:10,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:10,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 05:47:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 05:47:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:47:10,984 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:11,915 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-15 05:47:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 05:47:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 05:47:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-15 05:47:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-15 05:47:11,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 86 transitions. [2022-04-15 05:47:11,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:11,979 INFO L225 Difference]: With dead ends: 86 [2022-04-15 05:47:11,979 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 05:47:11,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4626, Invalid=5880, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 05:47:11,980 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:11,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 29 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 05:47:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-15 05:47:12,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:12,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:12,218 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:12,218 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:12,219 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 05:47:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-15 05:47:12,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:12,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:12,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-15 05:47:12,220 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-15 05:47:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:12,221 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 05:47:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-15 05:47:12,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:12,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:12,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:12,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-15 05:47:12,222 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2022-04-15 05:47:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:12,222 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-15 05:47:12,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:12,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-15 05:47:12,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-15 05:47:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 05:47:12,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:47:12,298 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:47:12,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 05:47:12,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:12,507 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:47:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:47:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1964362940, now seen corresponding path program 65 times [2022-04-15 05:47:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336445376] [2022-04-15 05:47:12,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:47:12,510 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:47:12,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:47:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1964362940, now seen corresponding path program 66 times [2022-04-15 05:47:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:47:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388052227] [2022-04-15 05:47:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:47:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:47:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:47:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:13,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {21008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-15 05:47:13,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-15 05:47:13,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-15 05:47:13,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {20969#true} call ULTIMATE.init(); {21008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:47:13,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {21008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-15 05:47:13,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-15 05:47:13,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-15 05:47:13,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {20969#true} call #t~ret6 := main(); {20969#true} is VALID [2022-04-15 05:47:13,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {20969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {20974#(= main_~i~0 0)} is VALID [2022-04-15 05:47:13,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {20974#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20974#(= main_~i~0 0)} is VALID [2022-04-15 05:47:13,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {20974#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20975#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:13,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {20975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20975#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:13,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {20975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20976#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:13,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {20976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20976#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:13,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {20976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20977#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:13,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {20977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20977#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:13,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {20977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20978#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:13,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {20978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20978#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:13,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {20978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20979#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:13,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {20979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20979#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:13,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {20979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20980#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:13,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {20980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20980#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:13,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {20980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20981#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:13,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {20981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20981#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:13,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {20981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20982#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:13,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {20982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20982#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:13,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {20982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20983#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:13,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {20983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20983#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:13,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {20983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20984#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:13,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {20984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20984#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:13,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {20984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20985#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:13,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {20985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20985#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:13,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {20985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20986#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:13,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {20986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20986#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:13,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {20986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20987#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:13,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {20987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20987#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:13,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {20987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20988#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:13,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {20988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20988#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:13,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {20988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20989#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:13,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {20989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20989#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:13,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20990#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:13,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {20990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20990#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:13,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {20990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20991#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:13,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {20991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20991#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:13,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {20991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20992#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:13,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {20992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20992#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:13,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {20992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20993#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:13,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {20993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20993#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:13,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {20993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20994#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:13,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {20994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20994#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:13,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {20994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20995#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:13,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {20995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20995#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:13,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {20995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20996#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:13,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {20996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20996#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:13,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {20996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20997#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:13,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {20997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20997#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:13,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {20997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20998#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:13,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {20998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20998#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:13,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {20998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20999#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:13,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {20999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20999#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:13,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {20999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21000#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:13,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {21000#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21000#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:13,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {21000#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21001#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:13,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {21001#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21001#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:13,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {21001#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21002#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:13,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {21002#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21002#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:13,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {21002#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21003#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:13,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {21003#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21003#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:13,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {21003#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21004#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:13,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {21004#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21004#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:13,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {21004#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21005#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:13,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {21005#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21005#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:13,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {21005#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21006#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:13,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {21006#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21006#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:13,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {21006#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21007#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:13,049 INFO L290 TraceCheckUtils]: 72: Hoare triple {21007#(<= main_~i~0 33)} assume !(~i~0 < 1024); {20970#false} is VALID [2022-04-15 05:47:13,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {20970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20970#false} is VALID [2022-04-15 05:47:13,049 INFO L272 TraceCheckUtils]: 74: Hoare triple {20970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {20970#false} is VALID [2022-04-15 05:47:13,049 INFO L290 TraceCheckUtils]: 75: Hoare triple {20970#false} ~cond := #in~cond; {20970#false} is VALID [2022-04-15 05:47:13,049 INFO L290 TraceCheckUtils]: 76: Hoare triple {20970#false} assume 0 == ~cond; {20970#false} is VALID [2022-04-15 05:47:13,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {20970#false} assume !false; {20970#false} is VALID [2022-04-15 05:47:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:47:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388052227] [2022-04-15 05:47:13,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388052227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:47:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828972273] [2022-04-15 05:47:13,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:47:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:47:13,051 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:47:13,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 05:47:25,776 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-15 05:47:25,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:25,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 05:47:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:25,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:26,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {20969#true} call ULTIMATE.init(); {20969#true} is VALID [2022-04-15 05:47:26,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {20969#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(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-15 05:47:26,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-15 05:47:26,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-15 05:47:26,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {20969#true} call #t~ret6 := main(); {20969#true} is VALID [2022-04-15 05:47:26,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {20969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {21027#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:26,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {21027#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21027#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:26,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {21027#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20975#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:26,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {20975#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20975#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:26,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {20975#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20976#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:26,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {20976#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20976#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:26,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {20976#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20977#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:26,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {20977#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20977#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:26,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {20977#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20978#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:26,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {20978#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20978#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:26,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {20978#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20979#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:26,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {20979#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20979#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:26,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {20979#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20980#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:26,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {20980#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20980#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:26,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {20980#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20981#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:26,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {20981#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20981#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:26,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {20981#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20982#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:26,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {20982#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20982#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:26,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {20982#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20983#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:26,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {20983#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20983#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:26,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {20983#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20984#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:26,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {20984#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20984#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:26,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {20984#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20985#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:26,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {20985#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20985#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:26,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {20985#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20986#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:26,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {20986#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20986#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:26,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {20986#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20987#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:26,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {20987#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20987#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:26,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {20987#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20988#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:26,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {20988#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20988#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:26,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {20988#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20989#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:26,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {20989#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20989#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:26,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20990#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:26,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {20990#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20990#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:26,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {20990#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20991#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:26,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {20991#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20991#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:26,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {20991#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20992#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:26,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {20992#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20992#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:26,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {20992#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20993#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:26,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {20993#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20993#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:26,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {20993#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20994#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:26,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {20994#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20994#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:26,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {20994#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20995#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:26,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {20995#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20995#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:26,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {20995#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20996#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:26,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {20996#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20996#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:26,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {20996#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20997#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:26,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {20997#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20997#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:26,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {20997#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20998#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:26,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {20998#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20998#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:26,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {20998#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20999#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:26,313 INFO L290 TraceCheckUtils]: 56: Hoare triple {20999#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20999#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:26,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {20999#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21000#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:26,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {21000#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21000#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:26,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {21000#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21001#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:26,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {21001#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21001#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:26,315 INFO L290 TraceCheckUtils]: 61: Hoare triple {21001#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21002#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:26,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {21002#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21002#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:26,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {21002#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21003#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:26,316 INFO L290 TraceCheckUtils]: 64: Hoare triple {21003#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21003#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:26,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {21003#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21004#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:26,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {21004#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21004#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:26,317 INFO L290 TraceCheckUtils]: 67: Hoare triple {21004#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21005#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:26,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {21005#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21005#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:26,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {21005#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21006#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:26,318 INFO L290 TraceCheckUtils]: 70: Hoare triple {21006#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21006#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:26,318 INFO L290 TraceCheckUtils]: 71: Hoare triple {21006#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21007#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:26,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {21007#(<= main_~i~0 33)} assume !(~i~0 < 1024); {20970#false} is VALID [2022-04-15 05:47:26,319 INFO L290 TraceCheckUtils]: 73: Hoare triple {20970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20970#false} is VALID [2022-04-15 05:47:26,319 INFO L272 TraceCheckUtils]: 74: Hoare triple {20970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {20970#false} is VALID [2022-04-15 05:47:26,319 INFO L290 TraceCheckUtils]: 75: Hoare triple {20970#false} ~cond := #in~cond; {20970#false} is VALID [2022-04-15 05:47:26,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {20970#false} assume 0 == ~cond; {20970#false} is VALID [2022-04-15 05:47:26,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {20970#false} assume !false; {20970#false} is VALID [2022-04-15 05:47:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:26,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:27,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {20970#false} assume !false; {20970#false} is VALID [2022-04-15 05:47:27,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {20970#false} assume 0 == ~cond; {20970#false} is VALID [2022-04-15 05:47:27,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {20970#false} ~cond := #in~cond; {20970#false} is VALID [2022-04-15 05:47:27,798 INFO L272 TraceCheckUtils]: 74: Hoare triple {20970#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {20970#false} is VALID [2022-04-15 05:47:27,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {20970#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20970#false} is VALID [2022-04-15 05:47:27,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {21259#(< main_~i~0 1024)} assume !(~i~0 < 1024); {20970#false} is VALID [2022-04-15 05:47:27,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {21263#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21259#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:27,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {21263#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21263#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:27,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {21270#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21263#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:27,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {21270#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21270#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:27,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {21277#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21270#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:27,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {21277#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21277#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:27,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {21284#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21277#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:27,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {21284#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21284#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:27,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {21291#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21284#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:27,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {21291#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21291#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:27,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {21298#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21291#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:27,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {21298#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21298#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:27,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {21305#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21298#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:27,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {21305#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21305#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:27,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {21312#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21305#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:27,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {21312#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21312#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:27,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {21319#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21312#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:27,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {21319#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21319#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:27,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {21326#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21319#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:27,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {21326#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21326#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:27,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {21333#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21326#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:27,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {21333#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21333#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:27,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {21340#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21333#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:27,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {21340#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21340#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:27,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {21347#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21340#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:27,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {21347#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21347#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:27,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {21354#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21347#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:27,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {21354#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21354#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:27,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {21361#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21354#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:27,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {21361#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21361#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:27,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {21368#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21361#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:27,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {21368#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21368#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:27,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {21375#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21368#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:27,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {21375#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21375#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:27,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {21382#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21375#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:27,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {21382#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21382#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:27,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {21389#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21382#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:27,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {21389#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21389#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:27,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {21396#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21389#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:27,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {21396#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21396#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:27,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {21403#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21396#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:27,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {21403#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21403#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:27,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {21410#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21403#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:27,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {21410#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21410#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:27,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {21417#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21410#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:27,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {21417#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21417#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:27,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {21424#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21417#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:27,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {21424#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21424#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:27,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {21431#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21424#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:27,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {21431#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21431#(< main_~i~0 999)} is VALID [2022-04-15 05:47:27,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {21438#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21431#(< main_~i~0 999)} is VALID [2022-04-15 05:47:27,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {21438#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21438#(< main_~i~0 998)} is VALID [2022-04-15 05:47:27,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {21445#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21438#(< main_~i~0 998)} is VALID [2022-04-15 05:47:27,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {21445#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21445#(< main_~i~0 997)} is VALID [2022-04-15 05:47:27,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {21452#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21445#(< main_~i~0 997)} is VALID [2022-04-15 05:47:27,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {21452#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21452#(< main_~i~0 996)} is VALID [2022-04-15 05:47:27,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {21459#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21452#(< main_~i~0 996)} is VALID [2022-04-15 05:47:27,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {21459#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21459#(< main_~i~0 995)} is VALID [2022-04-15 05:47:27,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {21466#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21459#(< main_~i~0 995)} is VALID [2022-04-15 05:47:27,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {21466#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21466#(< main_~i~0 994)} is VALID [2022-04-15 05:47:27,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {21473#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21466#(< main_~i~0 994)} is VALID [2022-04-15 05:47:27,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {21473#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21473#(< main_~i~0 993)} is VALID [2022-04-15 05:47:27,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {21480#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21473#(< main_~i~0 993)} is VALID [2022-04-15 05:47:27,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {21480#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21480#(< main_~i~0 992)} is VALID [2022-04-15 05:47:27,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {21487#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21480#(< main_~i~0 992)} is VALID [2022-04-15 05:47:27,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {21487#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21487#(< main_~i~0 991)} is VALID [2022-04-15 05:47:27,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {20969#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {21487#(< main_~i~0 991)} is VALID [2022-04-15 05:47:27,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {20969#true} call #t~ret6 := main(); {20969#true} is VALID [2022-04-15 05:47:27,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20969#true} {20969#true} #39#return; {20969#true} is VALID [2022-04-15 05:47:27,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {20969#true} assume true; {20969#true} is VALID [2022-04-15 05:47:27,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {20969#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(12, 2);call #Ultimate.allocInit(12, 3); {20969#true} is VALID [2022-04-15 05:47:27,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {20969#true} call ULTIMATE.init(); {20969#true} is VALID [2022-04-15 05:47:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:27,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828972273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:27,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:27,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 05:47:27,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336445376] [2022-04-15 05:47:27,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336445376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:27,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:27,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 05:47:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120152657] [2022-04-15 05:47:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:27,848 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 05:47:27,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:27,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:27,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:27,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 05:47:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 05:47:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 05:47:27,910 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:28,901 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-15 05:47:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 05:47:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 05:47:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-15 05:47:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-15 05:47:28,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 88 transitions. [2022-04-15 05:47:28,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:28,968 INFO L225 Difference]: With dead ends: 88 [2022-04-15 05:47:28,968 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 05:47:28,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 05:47:28,970 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:28,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 24 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 05:47:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-15 05:47:29,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:29,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:29,226 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:29,226 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:29,227 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 05:47:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-15 05:47:29,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:29,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:29,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-15 05:47:29,227 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-15 05:47:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:29,228 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 05:47:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-15 05:47:29,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:29,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:29,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:29,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2022-04-15 05:47:29,230 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2022-04-15 05:47:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:29,230 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2022-04-15 05:47:29,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:29,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 81 transitions. [2022-04-15 05:47:29,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-15 05:47:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 05:47:29,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:47:29,344 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:47:29,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 05:47:29,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-15 05:47:29,551 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:47:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:47:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1388054846, now seen corresponding path program 67 times [2022-04-15 05:47:29,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:29,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522960780] [2022-04-15 05:47:29,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:47:29,554 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:47:29,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:47:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1388054846, now seen corresponding path program 68 times [2022-04-15 05:47:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:47:29,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079537556] [2022-04-15 05:47:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:47:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:47:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:47:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:30,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {22121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-15 05:47:30,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-15 05:47:30,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-15 05:47:30,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {22081#true} call ULTIMATE.init(); {22121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:47:30,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {22121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-15 05:47:30,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-15 05:47:30,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-15 05:47:30,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {22081#true} call #t~ret6 := main(); {22081#true} is VALID [2022-04-15 05:47:30,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {22081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {22086#(= main_~i~0 0)} is VALID [2022-04-15 05:47:30,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {22086#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22086#(= main_~i~0 0)} is VALID [2022-04-15 05:47:30,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {22086#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22087#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:30,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {22087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22087#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:30,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {22087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22088#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:30,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {22088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22088#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:30,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {22088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22089#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:30,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {22089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22089#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:30,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {22089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22090#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:30,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {22090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22090#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:30,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {22090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22091#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:30,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {22091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22091#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:30,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {22091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22092#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:30,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {22092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22092#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:30,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {22092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22093#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:30,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {22093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22093#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:30,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {22093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22094#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:30,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {22094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22094#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:30,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {22094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22095#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:30,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {22095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22095#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:30,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {22095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22096#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:30,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {22096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22096#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:30,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {22096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22097#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:30,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {22097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22097#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:30,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {22097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22098#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:30,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {22098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22098#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:30,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {22098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22099#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:30,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {22099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22099#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:30,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {22099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22100#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:30,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {22100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22100#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:30,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {22100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22101#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:30,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {22101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22101#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:30,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {22101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22102#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:30,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22102#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:30,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22103#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:30,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {22103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22103#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:30,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {22103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22104#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:30,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {22104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22104#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:30,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {22104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22105#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:30,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {22105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22105#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:30,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22106#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:30,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {22106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22106#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:30,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {22106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22107#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:30,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {22107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22107#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:30,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {22107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22108#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:30,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {22108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22108#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:30,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {22108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22109#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:30,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {22109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22109#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:30,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {22109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22110#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:30,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {22110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22110#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:30,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {22110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22111#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:30,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {22111#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22111#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:30,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {22111#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22112#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:30,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {22112#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22112#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:30,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {22112#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22113#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:30,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {22113#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22113#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:30,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {22113#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22114#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:30,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {22114#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22114#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:30,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {22114#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22115#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:30,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {22115#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22115#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:30,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {22115#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22116#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:30,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {22116#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22116#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:30,120 INFO L290 TraceCheckUtils]: 67: Hoare triple {22116#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22117#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:30,120 INFO L290 TraceCheckUtils]: 68: Hoare triple {22117#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22117#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:30,121 INFO L290 TraceCheckUtils]: 69: Hoare triple {22117#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22118#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:30,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {22118#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22118#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:30,121 INFO L290 TraceCheckUtils]: 71: Hoare triple {22118#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22119#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:30,121 INFO L290 TraceCheckUtils]: 72: Hoare triple {22119#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22119#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:30,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {22119#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22120#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:30,122 INFO L290 TraceCheckUtils]: 74: Hoare triple {22120#(<= main_~i~0 34)} assume !(~i~0 < 1024); {22082#false} is VALID [2022-04-15 05:47:30,122 INFO L290 TraceCheckUtils]: 75: Hoare triple {22082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22082#false} is VALID [2022-04-15 05:47:30,122 INFO L272 TraceCheckUtils]: 76: Hoare triple {22082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {22082#false} is VALID [2022-04-15 05:47:30,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {22082#false} ~cond := #in~cond; {22082#false} is VALID [2022-04-15 05:47:30,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {22082#false} assume 0 == ~cond; {22082#false} is VALID [2022-04-15 05:47:30,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {22082#false} assume !false; {22082#false} is VALID [2022-04-15 05:47:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:47:30,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079537556] [2022-04-15 05:47:30,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079537556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:47:30,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401945666] [2022-04-15 05:47:30,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:47:30,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:30,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:47:30,124 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:47:30,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 05:47:30,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:47:30,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:30,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 05:47:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:30,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:30,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {22081#true} call ULTIMATE.init(); {22081#true} is VALID [2022-04-15 05:47:30,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {22081#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(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-15 05:47:30,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-15 05:47:30,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-15 05:47:30,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {22081#true} call #t~ret6 := main(); {22081#true} is VALID [2022-04-15 05:47:30,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {22081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {22140#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:30,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {22140#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22140#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:30,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {22140#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22087#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:30,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {22087#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22087#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:30,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {22087#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22088#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:30,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {22088#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22088#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:30,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {22088#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22089#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:30,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {22089#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22089#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:30,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {22089#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22090#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:30,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {22090#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22090#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:30,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {22090#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22091#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:30,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {22091#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22091#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:30,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {22091#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22092#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:30,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {22092#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22092#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:30,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {22092#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22093#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:30,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {22093#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22093#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:30,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {22093#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22094#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:30,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {22094#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22094#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:30,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {22094#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22095#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:30,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {22095#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22095#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:30,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {22095#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22096#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:30,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {22096#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22096#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:30,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {22096#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22097#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:30,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {22097#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22097#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:30,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {22097#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22098#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:30,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {22098#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22098#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:30,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {22098#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22099#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:30,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {22099#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22099#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:30,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {22099#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22100#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:30,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {22100#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22100#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:30,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {22100#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22101#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:30,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {22101#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22101#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:30,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {22101#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22102#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:30,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22102#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:30,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22103#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:30,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {22103#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22103#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:30,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {22103#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22104#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:30,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {22104#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22104#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:30,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {22104#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22105#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:30,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {22105#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22105#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:30,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {22105#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22106#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:30,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {22106#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22106#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:30,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {22106#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22107#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:30,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {22107#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22107#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:30,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {22107#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22108#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:30,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {22108#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22108#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:30,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {22108#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22109#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:30,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {22109#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22109#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:30,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {22109#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22110#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:30,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {22110#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22110#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:30,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {22110#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22111#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:30,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {22111#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22111#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:30,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {22111#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22112#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:30,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {22112#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22112#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:30,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {22112#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22113#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:30,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {22113#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22113#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:30,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {22113#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22114#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:30,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {22114#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22114#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:30,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {22114#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22115#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:30,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {22115#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22115#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:30,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {22115#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22116#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:30,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {22116#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22116#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:30,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {22116#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22117#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:30,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {22117#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22117#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:30,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {22117#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22118#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:30,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {22118#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22118#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:30,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {22118#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22119#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:30,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {22119#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22119#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:30,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {22119#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22120#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:30,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {22120#(<= main_~i~0 34)} assume !(~i~0 < 1024); {22082#false} is VALID [2022-04-15 05:47:30,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {22082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22082#false} is VALID [2022-04-15 05:47:30,754 INFO L272 TraceCheckUtils]: 76: Hoare triple {22082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {22082#false} is VALID [2022-04-15 05:47:30,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {22082#false} ~cond := #in~cond; {22082#false} is VALID [2022-04-15 05:47:30,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {22082#false} assume 0 == ~cond; {22082#false} is VALID [2022-04-15 05:47:30,754 INFO L290 TraceCheckUtils]: 79: Hoare triple {22082#false} assume !false; {22082#false} is VALID [2022-04-15 05:47:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:30,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:32,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {22082#false} assume !false; {22082#false} is VALID [2022-04-15 05:47:32,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {22082#false} assume 0 == ~cond; {22082#false} is VALID [2022-04-15 05:47:32,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {22082#false} ~cond := #in~cond; {22082#false} is VALID [2022-04-15 05:47:32,302 INFO L272 TraceCheckUtils]: 76: Hoare triple {22082#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {22082#false} is VALID [2022-04-15 05:47:32,302 INFO L290 TraceCheckUtils]: 75: Hoare triple {22082#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22082#false} is VALID [2022-04-15 05:47:32,302 INFO L290 TraceCheckUtils]: 74: Hoare triple {22378#(< main_~i~0 1024)} assume !(~i~0 < 1024); {22082#false} is VALID [2022-04-15 05:47:32,302 INFO L290 TraceCheckUtils]: 73: Hoare triple {22382#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22378#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:32,303 INFO L290 TraceCheckUtils]: 72: Hoare triple {22382#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22382#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:32,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {22389#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22382#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:32,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {22389#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22389#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:32,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {22396#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22389#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:32,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {22396#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22396#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:32,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {22403#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22396#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:32,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {22403#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22403#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:32,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {22410#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22403#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:32,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {22410#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22410#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:32,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {22417#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22410#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:32,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {22417#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22417#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:32,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {22424#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22417#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:32,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {22424#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22424#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:32,307 INFO L290 TraceCheckUtils]: 59: Hoare triple {22431#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22424#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:32,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {22431#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22431#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:32,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {22438#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22431#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:32,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {22438#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22438#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:32,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {22445#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22438#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:32,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {22445#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22445#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:32,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {22452#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22445#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:32,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {22452#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22452#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:32,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {22459#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22452#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:32,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {22459#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22459#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:32,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {22466#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22459#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:32,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {22466#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22466#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:32,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {22473#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22466#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:32,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {22473#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22473#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:32,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {22480#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22473#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:32,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {22480#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22480#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:32,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {22487#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22480#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:32,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {22487#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22487#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:32,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {22494#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22487#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:32,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {22494#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22494#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:32,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {22501#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22494#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:32,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {22501#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22501#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:32,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {22508#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22501#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:32,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {22508#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22508#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:32,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {22515#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22508#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:32,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {22515#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22515#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:32,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {22522#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22515#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:32,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {22522#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22522#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:32,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {22529#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22522#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:32,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {22529#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22529#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:32,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {22536#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22529#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:32,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {22536#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22536#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:32,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {22543#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22536#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:32,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {22543#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22543#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:32,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {22550#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22543#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:32,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {22550#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22550#(< main_~i~0 999)} is VALID [2022-04-15 05:47:32,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {22557#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22550#(< main_~i~0 999)} is VALID [2022-04-15 05:47:32,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {22557#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22557#(< main_~i~0 998)} is VALID [2022-04-15 05:47:32,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {22564#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22557#(< main_~i~0 998)} is VALID [2022-04-15 05:47:32,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {22564#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22564#(< main_~i~0 997)} is VALID [2022-04-15 05:47:32,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {22571#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22564#(< main_~i~0 997)} is VALID [2022-04-15 05:47:32,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {22571#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22571#(< main_~i~0 996)} is VALID [2022-04-15 05:47:32,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {22578#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22571#(< main_~i~0 996)} is VALID [2022-04-15 05:47:32,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {22578#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22578#(< main_~i~0 995)} is VALID [2022-04-15 05:47:32,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {22585#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22578#(< main_~i~0 995)} is VALID [2022-04-15 05:47:32,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {22585#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22585#(< main_~i~0 994)} is VALID [2022-04-15 05:47:32,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {22592#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22585#(< main_~i~0 994)} is VALID [2022-04-15 05:47:32,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {22592#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22592#(< main_~i~0 993)} is VALID [2022-04-15 05:47:32,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {22599#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22592#(< main_~i~0 993)} is VALID [2022-04-15 05:47:32,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {22599#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22599#(< main_~i~0 992)} is VALID [2022-04-15 05:47:32,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {22606#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22599#(< main_~i~0 992)} is VALID [2022-04-15 05:47:32,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {22606#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22606#(< main_~i~0 991)} is VALID [2022-04-15 05:47:32,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {22613#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22606#(< main_~i~0 991)} is VALID [2022-04-15 05:47:32,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {22613#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22613#(< main_~i~0 990)} is VALID [2022-04-15 05:47:32,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {22081#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {22613#(< main_~i~0 990)} is VALID [2022-04-15 05:47:32,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {22081#true} call #t~ret6 := main(); {22081#true} is VALID [2022-04-15 05:47:32,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22081#true} {22081#true} #39#return; {22081#true} is VALID [2022-04-15 05:47:32,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {22081#true} assume true; {22081#true} is VALID [2022-04-15 05:47:32,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {22081#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(12, 2);call #Ultimate.allocInit(12, 3); {22081#true} is VALID [2022-04-15 05:47:32,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {22081#true} call ULTIMATE.init(); {22081#true} is VALID [2022-04-15 05:47:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:32,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401945666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:32,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:32,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 05:47:32,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:32,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522960780] [2022-04-15 05:47:32,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522960780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:32,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:32,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 05:47:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182785259] [2022-04-15 05:47:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 05:47:32,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:32,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:32,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:32,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 05:47:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 05:47:32,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 05:47:32,378 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:33,362 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-15 05:47:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 05:47:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 05:47:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-15 05:47:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-15 05:47:33,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 90 transitions. [2022-04-15 05:47:33,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:33,427 INFO L225 Difference]: With dead ends: 90 [2022-04-15 05:47:33,427 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 05:47:33,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 05:47:33,429 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:33,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 29 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 05:47:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-04-15 05:47:33,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:33,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,685 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,686 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:33,686 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-15 05:47:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-15 05:47:33,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:33,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:33,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 05:47:33,687 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-15 05:47:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:33,688 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-15 05:47:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-15 05:47:33,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:33,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:33,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:33,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2022-04-15 05:47:33,690 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2022-04-15 05:47:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:33,690 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2022-04-15 05:47:33,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:33,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 83 transitions. [2022-04-15 05:47:33,776 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-15 05:47:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-15 05:47:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 05:47:33,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:47:33,777 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:47:33,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 05:47:33,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 05:47:33,983 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:47:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:47:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1606757696, now seen corresponding path program 69 times [2022-04-15 05:47:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:33,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520597323] [2022-04-15 05:47:33,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:47:33,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:47:33,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:47:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1606757696, now seen corresponding path program 70 times [2022-04-15 05:47:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:47:33,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148449896] [2022-04-15 05:47:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:47:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:47:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:47:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:34,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-15 05:47:34,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-15 05:47:34,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-15 05:47:34,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {23221#true} call ULTIMATE.init(); {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:47:34,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {23262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-15 05:47:34,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-15 05:47:34,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-15 05:47:34,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {23221#true} call #t~ret6 := main(); {23221#true} is VALID [2022-04-15 05:47:34,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {23221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {23226#(= main_~i~0 0)} is VALID [2022-04-15 05:47:34,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {23226#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23226#(= main_~i~0 0)} is VALID [2022-04-15 05:47:34,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {23226#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23227#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:34,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {23227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:34,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {23227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23228#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:34,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {23228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:34,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {23228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23229#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:34,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {23229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:34,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {23229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23230#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:34,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {23230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:34,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {23230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23231#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:34,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {23231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:34,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {23231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23232#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:34,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {23232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:34,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {23232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23233#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:34,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {23233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:34,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {23233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23234#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:34,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {23234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:34,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {23234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23235#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:34,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {23235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:34,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {23235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23236#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:34,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {23236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:34,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {23236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23237#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:34,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {23237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:34,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {23237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23238#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:34,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {23238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:34,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {23238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23239#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:34,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {23239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:34,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {23239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23240#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:34,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {23240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:34,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {23240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23241#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:34,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {23241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:34,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {23241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23242#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:34,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {23242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:34,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {23242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23243#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:34,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {23243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:34,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {23243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23244#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:34,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {23244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:34,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {23244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23245#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:34,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {23245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:34,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {23245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23246#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:34,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {23246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:34,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {23246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23247#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:34,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {23247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:34,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {23247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23248#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:34,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {23248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:34,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {23248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23249#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:34,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {23249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:34,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23250#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:34,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {23250#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:34,638 INFO L290 TraceCheckUtils]: 55: Hoare triple {23250#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23251#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:34,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {23251#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:34,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {23251#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23252#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:34,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {23252#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:34,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {23252#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23253#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:34,640 INFO L290 TraceCheckUtils]: 60: Hoare triple {23253#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:34,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {23253#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23254#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:34,640 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:34,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23255#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:34,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {23255#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:34,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {23255#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23256#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:34,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {23256#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:34,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {23256#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23257#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:34,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {23257#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:34,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {23257#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23258#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:34,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {23258#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:34,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {23258#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23259#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:34,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {23259#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23259#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:34,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {23259#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23260#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:34,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {23260#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23260#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:34,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {23260#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23261#(<= main_~i~0 35)} is VALID [2022-04-15 05:47:34,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {23261#(<= main_~i~0 35)} assume !(~i~0 < 1024); {23222#false} is VALID [2022-04-15 05:47:34,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {23222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23222#false} is VALID [2022-04-15 05:47:34,645 INFO L272 TraceCheckUtils]: 78: Hoare triple {23222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {23222#false} is VALID [2022-04-15 05:47:34,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {23222#false} ~cond := #in~cond; {23222#false} is VALID [2022-04-15 05:47:34,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {23222#false} assume 0 == ~cond; {23222#false} is VALID [2022-04-15 05:47:34,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {23222#false} assume !false; {23222#false} is VALID [2022-04-15 05:47:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:47:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148449896] [2022-04-15 05:47:34,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148449896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:47:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496363055] [2022-04-15 05:47:34,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:47:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:47:34,646 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:47:34,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 05:47:34,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:47:34,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:34,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 05:47:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:34,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:35,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {23221#true} call ULTIMATE.init(); {23221#true} is VALID [2022-04-15 05:47:35,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {23221#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(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-15 05:47:35,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-15 05:47:35,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-15 05:47:35,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {23221#true} call #t~ret6 := main(); {23221#true} is VALID [2022-04-15 05:47:35,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {23221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {23281#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:35,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {23281#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23281#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:35,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {23281#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23227#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:35,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {23227#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:35,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {23227#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23228#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:35,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {23228#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:35,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {23228#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23229#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:35,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {23229#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:35,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {23229#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23230#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:35,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {23230#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:35,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {23230#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23231#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:35,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {23231#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:35,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {23231#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23232#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:35,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {23232#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:35,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {23232#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23233#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:35,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {23233#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:35,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {23233#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23234#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:35,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {23234#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:35,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {23234#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23235#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:35,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {23235#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:35,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {23235#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23236#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:35,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {23236#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:35,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {23236#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23237#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:35,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {23237#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:35,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {23237#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23238#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:35,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {23238#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:35,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {23238#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23239#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:35,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {23239#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:35,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {23239#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23240#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:35,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {23240#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:35,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {23240#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23241#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:35,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {23241#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:35,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {23241#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23242#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:35,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {23242#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:35,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {23242#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23243#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:35,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {23243#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:35,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {23243#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23244#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:35,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {23244#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:35,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {23244#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23245#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:35,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {23245#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:35,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {23245#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23246#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:35,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {23246#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:35,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {23246#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23247#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:35,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {23247#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:35,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {23247#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23248#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:35,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {23248#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:35,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {23248#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23249#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:35,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {23249#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:35,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23250#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:35,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {23250#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:35,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {23250#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23251#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:35,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {23251#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:35,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {23251#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23252#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:35,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {23252#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:35,307 INFO L290 TraceCheckUtils]: 59: Hoare triple {23252#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23253#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:35,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {23253#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:35,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {23253#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23254#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:35,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:35,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23255#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:35,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {23255#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:35,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {23255#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23256#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:35,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {23256#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:35,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {23256#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23257#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:35,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {23257#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:35,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {23257#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23258#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:35,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {23258#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:35,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {23258#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23259#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:35,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {23259#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23259#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:35,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {23259#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23260#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:35,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {23260#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23260#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:35,312 INFO L290 TraceCheckUtils]: 75: Hoare triple {23260#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23261#(<= main_~i~0 35)} is VALID [2022-04-15 05:47:35,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {23261#(<= main_~i~0 35)} assume !(~i~0 < 1024); {23222#false} is VALID [2022-04-15 05:47:35,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {23222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23222#false} is VALID [2022-04-15 05:47:35,312 INFO L272 TraceCheckUtils]: 78: Hoare triple {23222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {23222#false} is VALID [2022-04-15 05:47:35,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {23222#false} ~cond := #in~cond; {23222#false} is VALID [2022-04-15 05:47:35,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {23222#false} assume 0 == ~cond; {23222#false} is VALID [2022-04-15 05:47:35,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {23222#false} assume !false; {23222#false} is VALID [2022-04-15 05:47:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:35,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:36,992 INFO L290 TraceCheckUtils]: 81: Hoare triple {23222#false} assume !false; {23222#false} is VALID [2022-04-15 05:47:36,992 INFO L290 TraceCheckUtils]: 80: Hoare triple {23222#false} assume 0 == ~cond; {23222#false} is VALID [2022-04-15 05:47:36,992 INFO L290 TraceCheckUtils]: 79: Hoare triple {23222#false} ~cond := #in~cond; {23222#false} is VALID [2022-04-15 05:47:36,992 INFO L272 TraceCheckUtils]: 78: Hoare triple {23222#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {23222#false} is VALID [2022-04-15 05:47:36,992 INFO L290 TraceCheckUtils]: 77: Hoare triple {23222#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23222#false} is VALID [2022-04-15 05:47:36,993 INFO L290 TraceCheckUtils]: 76: Hoare triple {23525#(< main_~i~0 1024)} assume !(~i~0 < 1024); {23222#false} is VALID [2022-04-15 05:47:36,993 INFO L290 TraceCheckUtils]: 75: Hoare triple {23529#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23525#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:36,993 INFO L290 TraceCheckUtils]: 74: Hoare triple {23529#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23529#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:36,994 INFO L290 TraceCheckUtils]: 73: Hoare triple {23536#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23529#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:36,994 INFO L290 TraceCheckUtils]: 72: Hoare triple {23536#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23536#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:36,994 INFO L290 TraceCheckUtils]: 71: Hoare triple {23543#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23536#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:36,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {23543#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23543#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:36,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {23550#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23543#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:36,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {23550#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23550#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:36,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {23557#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23550#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:36,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {23557#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23557#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:36,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {23564#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23557#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:36,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {23564#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23564#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:36,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {23571#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23564#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:36,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {23571#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23571#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:36,998 INFO L290 TraceCheckUtils]: 61: Hoare triple {23578#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23571#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:36,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {23578#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23578#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:36,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {23585#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23578#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:36,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {23585#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23585#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:36,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {23592#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23585#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:36,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {23592#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23592#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:36,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {23599#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23592#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:37,000 INFO L290 TraceCheckUtils]: 54: Hoare triple {23599#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23599#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:37,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {23606#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23599#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:37,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {23606#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23606#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:37,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {23613#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23606#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:37,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {23613#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23613#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:37,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {23620#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23613#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:37,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {23620#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23620#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:37,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {23627#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23620#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:37,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {23627#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23627#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:37,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {23634#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23627#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:37,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {23634#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23634#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:37,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {23641#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23634#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:37,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {23641#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23641#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:37,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {23648#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23641#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:37,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {23648#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23648#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:37,004 INFO L290 TraceCheckUtils]: 39: Hoare triple {23655#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23648#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:37,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {23655#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23655#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:37,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {23662#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23655#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:37,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {23662#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23662#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:37,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {23669#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23662#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:37,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {23669#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23669#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:37,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {23676#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23669#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:37,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {23676#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23676#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:37,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {23683#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23676#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:37,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {23683#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23683#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:37,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {23690#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23683#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:37,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {23690#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23690#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:37,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {23697#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23690#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:37,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {23697#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23697#(< main_~i~0 999)} is VALID [2022-04-15 05:47:37,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {23704#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23697#(< main_~i~0 999)} is VALID [2022-04-15 05:47:37,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {23704#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23704#(< main_~i~0 998)} is VALID [2022-04-15 05:47:37,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {23711#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23704#(< main_~i~0 998)} is VALID [2022-04-15 05:47:37,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {23711#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23711#(< main_~i~0 997)} is VALID [2022-04-15 05:47:37,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {23718#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23711#(< main_~i~0 997)} is VALID [2022-04-15 05:47:37,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {23718#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23718#(< main_~i~0 996)} is VALID [2022-04-15 05:47:37,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {23725#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23718#(< main_~i~0 996)} is VALID [2022-04-15 05:47:37,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {23725#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23725#(< main_~i~0 995)} is VALID [2022-04-15 05:47:37,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {23732#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23725#(< main_~i~0 995)} is VALID [2022-04-15 05:47:37,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {23732#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23732#(< main_~i~0 994)} is VALID [2022-04-15 05:47:37,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {23739#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23732#(< main_~i~0 994)} is VALID [2022-04-15 05:47:37,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {23739#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23739#(< main_~i~0 993)} is VALID [2022-04-15 05:47:37,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {23746#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23739#(< main_~i~0 993)} is VALID [2022-04-15 05:47:37,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {23746#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23746#(< main_~i~0 992)} is VALID [2022-04-15 05:47:37,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {23753#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23746#(< main_~i~0 992)} is VALID [2022-04-15 05:47:37,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {23753#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23753#(< main_~i~0 991)} is VALID [2022-04-15 05:47:37,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {23760#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23753#(< main_~i~0 991)} is VALID [2022-04-15 05:47:37,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {23760#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23760#(< main_~i~0 990)} is VALID [2022-04-15 05:47:37,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {23767#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {23760#(< main_~i~0 990)} is VALID [2022-04-15 05:47:37,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {23767#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23767#(< main_~i~0 989)} is VALID [2022-04-15 05:47:37,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {23221#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {23767#(< main_~i~0 989)} is VALID [2022-04-15 05:47:37,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {23221#true} call #t~ret6 := main(); {23221#true} is VALID [2022-04-15 05:47:37,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23221#true} {23221#true} #39#return; {23221#true} is VALID [2022-04-15 05:47:37,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {23221#true} assume true; {23221#true} is VALID [2022-04-15 05:47:37,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {23221#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(12, 2);call #Ultimate.allocInit(12, 3); {23221#true} is VALID [2022-04-15 05:47:37,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {23221#true} call ULTIMATE.init(); {23221#true} is VALID [2022-04-15 05:47:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:37,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496363055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:37,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:37,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 05:47:37,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:37,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520597323] [2022-04-15 05:47:37,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520597323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:37,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:37,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 05:47:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807501822] [2022-04-15 05:47:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 05:47:37,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:37,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:37,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:37,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 05:47:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 05:47:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 05:47:37,090 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:38,217 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-15 05:47:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 05:47:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 05:47:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-15 05:47:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-15 05:47:38,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 92 transitions. [2022-04-15 05:47:38,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:38,295 INFO L225 Difference]: With dead ends: 92 [2022-04-15 05:47:38,295 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 05:47:38,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5478, Invalid=6954, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 05:47:38,296 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:38,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 49 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 05:47:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-15 05:47:38,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:38,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,572 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,572 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:38,573 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-15 05:47:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-15 05:47:38,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:38,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:38,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-15 05:47:38,574 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-15 05:47:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:38,575 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-15 05:47:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-15 05:47:38,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:38,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:38,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:38,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2022-04-15 05:47:38,576 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2022-04-15 05:47:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:38,577 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2022-04-15 05:47:38,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:38,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 85 transitions. [2022-04-15 05:47:38,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2022-04-15 05:47:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 05:47:38,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:47:38,670 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:47:38,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 05:47:38,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 05:47:38,871 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:47:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:47:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1326799042, now seen corresponding path program 71 times [2022-04-15 05:47:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:38,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005416562] [2022-04-15 05:47:38,874 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:47:38,874 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:47:38,874 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:47:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1326799042, now seen corresponding path program 72 times [2022-04-15 05:47:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:47:38,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025222949] [2022-04-15 05:47:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:47:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:47:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:47:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:39,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {24431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-15 05:47:39,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-15 05:47:39,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-15 05:47:39,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {24389#true} call ULTIMATE.init(); {24431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:47:39,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {24431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-15 05:47:39,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-15 05:47:39,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-15 05:47:39,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {24389#true} call #t~ret6 := main(); {24389#true} is VALID [2022-04-15 05:47:39,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {24389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24394#(= main_~i~0 0)} is VALID [2022-04-15 05:47:39,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {24394#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24394#(= main_~i~0 0)} is VALID [2022-04-15 05:47:39,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {24394#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24395#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:39,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {24395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24395#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:39,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {24395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24396#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:39,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {24396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24396#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:39,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {24396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24397#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:39,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {24397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24397#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:39,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {24397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24398#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:39,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {24398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24398#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:39,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {24398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24399#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:39,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {24399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24399#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:39,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {24399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24400#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:39,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {24400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24400#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:39,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {24400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24401#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:39,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {24401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24401#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:39,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {24401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24402#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:39,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {24402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24402#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:39,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {24402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24403#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:39,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {24403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24403#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:39,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {24403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24404#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:39,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {24404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24404#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:39,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {24404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24405#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:39,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {24405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24405#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:39,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {24405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24406#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:39,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {24406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24406#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:39,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {24406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24407#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:39,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {24407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24407#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:39,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {24407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24408#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:39,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {24408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24408#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:39,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {24408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24409#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:39,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {24409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24409#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:39,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {24409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24410#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:39,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {24410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24410#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:39,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {24410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24411#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:39,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {24411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24411#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:39,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {24411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24412#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:39,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {24412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24412#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:39,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {24412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:39,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {24413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24413#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:39,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {24413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24414#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:39,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {24414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24414#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:39,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {24414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24415#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:39,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {24415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24415#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:39,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {24415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24416#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:39,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {24416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24416#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:39,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {24416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24417#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:39,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {24417#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24417#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:39,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {24417#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24418#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:39,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {24418#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24418#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:39,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {24418#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24419#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:39,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {24419#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24419#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:39,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {24419#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24420#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:39,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {24420#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24420#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:39,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {24420#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24421#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:39,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {24421#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24421#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:39,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {24421#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24422#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:39,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {24422#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24422#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:39,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {24422#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24423#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:39,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {24423#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24423#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:39,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {24423#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24424#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:39,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {24424#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24424#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:39,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {24424#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24425#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:39,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {24425#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24425#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:39,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {24425#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24426#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:39,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {24426#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24426#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:39,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {24426#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24427#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:39,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {24427#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24427#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:39,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {24427#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24428#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:39,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {24428#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24428#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:39,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {24428#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24429#(<= main_~i~0 35)} is VALID [2022-04-15 05:47:39,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {24429#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24429#(<= main_~i~0 35)} is VALID [2022-04-15 05:47:39,523 INFO L290 TraceCheckUtils]: 77: Hoare triple {24429#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24430#(<= main_~i~0 36)} is VALID [2022-04-15 05:47:39,523 INFO L290 TraceCheckUtils]: 78: Hoare triple {24430#(<= main_~i~0 36)} assume !(~i~0 < 1024); {24390#false} is VALID [2022-04-15 05:47:39,523 INFO L290 TraceCheckUtils]: 79: Hoare triple {24390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24390#false} is VALID [2022-04-15 05:47:39,523 INFO L272 TraceCheckUtils]: 80: Hoare triple {24390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {24390#false} is VALID [2022-04-15 05:47:39,523 INFO L290 TraceCheckUtils]: 81: Hoare triple {24390#false} ~cond := #in~cond; {24390#false} is VALID [2022-04-15 05:47:39,523 INFO L290 TraceCheckUtils]: 82: Hoare triple {24390#false} assume 0 == ~cond; {24390#false} is VALID [2022-04-15 05:47:39,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {24390#false} assume !false; {24390#false} is VALID [2022-04-15 05:47:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:47:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025222949] [2022-04-15 05:47:39,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025222949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:47:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877802370] [2022-04-15 05:47:39,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:47:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:47:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:47:39,528 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:47:39,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 05:47:56,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-15 05:47:56,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:47:56,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 05:47:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:47:56,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:47:56,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {24389#true} call ULTIMATE.init(); {24389#true} is VALID [2022-04-15 05:47:56,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {24389#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(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-15 05:47:56,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-15 05:47:56,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-15 05:47:56,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {24389#true} call #t~ret6 := main(); {24389#true} is VALID [2022-04-15 05:47:56,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {24389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24450#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:56,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {24450#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24450#(<= main_~i~0 0)} is VALID [2022-04-15 05:47:56,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {24450#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24395#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:56,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {24395#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24395#(<= main_~i~0 1)} is VALID [2022-04-15 05:47:56,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {24395#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24396#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:56,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {24396#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24396#(<= main_~i~0 2)} is VALID [2022-04-15 05:47:56,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {24396#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24397#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:56,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {24397#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24397#(<= main_~i~0 3)} is VALID [2022-04-15 05:47:56,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {24397#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24398#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:56,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {24398#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24398#(<= main_~i~0 4)} is VALID [2022-04-15 05:47:56,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {24398#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24399#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:56,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {24399#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24399#(<= main_~i~0 5)} is VALID [2022-04-15 05:47:56,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {24399#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24400#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:56,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {24400#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24400#(<= main_~i~0 6)} is VALID [2022-04-15 05:47:56,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {24400#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24401#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:56,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {24401#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24401#(<= main_~i~0 7)} is VALID [2022-04-15 05:47:56,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {24401#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24402#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:56,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {24402#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24402#(<= main_~i~0 8)} is VALID [2022-04-15 05:47:56,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {24402#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24403#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:56,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {24403#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24403#(<= main_~i~0 9)} is VALID [2022-04-15 05:47:56,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {24403#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24404#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:56,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {24404#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24404#(<= main_~i~0 10)} is VALID [2022-04-15 05:47:56,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {24404#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24405#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:56,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {24405#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24405#(<= main_~i~0 11)} is VALID [2022-04-15 05:47:56,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {24405#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24406#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:56,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {24406#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24406#(<= main_~i~0 12)} is VALID [2022-04-15 05:47:56,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {24406#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24407#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:56,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {24407#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24407#(<= main_~i~0 13)} is VALID [2022-04-15 05:47:56,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {24407#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24408#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:56,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {24408#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24408#(<= main_~i~0 14)} is VALID [2022-04-15 05:47:56,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {24408#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24409#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:56,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {24409#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24409#(<= main_~i~0 15)} is VALID [2022-04-15 05:47:56,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {24409#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24410#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:56,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {24410#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24410#(<= main_~i~0 16)} is VALID [2022-04-15 05:47:56,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {24410#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24411#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:56,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {24411#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24411#(<= main_~i~0 17)} is VALID [2022-04-15 05:47:56,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {24411#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24412#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:56,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {24412#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24412#(<= main_~i~0 18)} is VALID [2022-04-15 05:47:56,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {24412#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24413#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:56,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {24413#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24413#(<= main_~i~0 19)} is VALID [2022-04-15 05:47:56,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {24413#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24414#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:56,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {24414#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24414#(<= main_~i~0 20)} is VALID [2022-04-15 05:47:56,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {24414#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24415#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:56,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {24415#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24415#(<= main_~i~0 21)} is VALID [2022-04-15 05:47:56,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {24415#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24416#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:56,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {24416#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24416#(<= main_~i~0 22)} is VALID [2022-04-15 05:47:56,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {24416#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24417#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:56,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {24417#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24417#(<= main_~i~0 23)} is VALID [2022-04-15 05:47:56,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {24417#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24418#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:56,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {24418#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24418#(<= main_~i~0 24)} is VALID [2022-04-15 05:47:56,672 INFO L290 TraceCheckUtils]: 55: Hoare triple {24418#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24419#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:56,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {24419#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24419#(<= main_~i~0 25)} is VALID [2022-04-15 05:47:56,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {24419#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24420#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:56,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {24420#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24420#(<= main_~i~0 26)} is VALID [2022-04-15 05:47:56,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {24420#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24421#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:56,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {24421#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24421#(<= main_~i~0 27)} is VALID [2022-04-15 05:47:56,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {24421#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24422#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:56,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {24422#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24422#(<= main_~i~0 28)} is VALID [2022-04-15 05:47:56,674 INFO L290 TraceCheckUtils]: 63: Hoare triple {24422#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24423#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:56,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {24423#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24423#(<= main_~i~0 29)} is VALID [2022-04-15 05:47:56,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {24423#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24424#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:56,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {24424#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24424#(<= main_~i~0 30)} is VALID [2022-04-15 05:47:56,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {24424#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24425#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:56,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {24425#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24425#(<= main_~i~0 31)} is VALID [2022-04-15 05:47:56,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {24425#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24426#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:56,677 INFO L290 TraceCheckUtils]: 70: Hoare triple {24426#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24426#(<= main_~i~0 32)} is VALID [2022-04-15 05:47:56,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {24426#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24427#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:56,677 INFO L290 TraceCheckUtils]: 72: Hoare triple {24427#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24427#(<= main_~i~0 33)} is VALID [2022-04-15 05:47:56,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {24427#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24428#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:56,678 INFO L290 TraceCheckUtils]: 74: Hoare triple {24428#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24428#(<= main_~i~0 34)} is VALID [2022-04-15 05:47:56,678 INFO L290 TraceCheckUtils]: 75: Hoare triple {24428#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24429#(<= main_~i~0 35)} is VALID [2022-04-15 05:47:56,678 INFO L290 TraceCheckUtils]: 76: Hoare triple {24429#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24429#(<= main_~i~0 35)} is VALID [2022-04-15 05:47:56,679 INFO L290 TraceCheckUtils]: 77: Hoare triple {24429#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24430#(<= main_~i~0 36)} is VALID [2022-04-15 05:47:56,679 INFO L290 TraceCheckUtils]: 78: Hoare triple {24430#(<= main_~i~0 36)} assume !(~i~0 < 1024); {24390#false} is VALID [2022-04-15 05:47:56,679 INFO L290 TraceCheckUtils]: 79: Hoare triple {24390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24390#false} is VALID [2022-04-15 05:47:56,679 INFO L272 TraceCheckUtils]: 80: Hoare triple {24390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {24390#false} is VALID [2022-04-15 05:47:56,679 INFO L290 TraceCheckUtils]: 81: Hoare triple {24390#false} ~cond := #in~cond; {24390#false} is VALID [2022-04-15 05:47:56,679 INFO L290 TraceCheckUtils]: 82: Hoare triple {24390#false} assume 0 == ~cond; {24390#false} is VALID [2022-04-15 05:47:56,679 INFO L290 TraceCheckUtils]: 83: Hoare triple {24390#false} assume !false; {24390#false} is VALID [2022-04-15 05:47:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:56,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:47:58,395 INFO L290 TraceCheckUtils]: 83: Hoare triple {24390#false} assume !false; {24390#false} is VALID [2022-04-15 05:47:58,395 INFO L290 TraceCheckUtils]: 82: Hoare triple {24390#false} assume 0 == ~cond; {24390#false} is VALID [2022-04-15 05:47:58,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {24390#false} ~cond := #in~cond; {24390#false} is VALID [2022-04-15 05:47:58,395 INFO L272 TraceCheckUtils]: 80: Hoare triple {24390#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {24390#false} is VALID [2022-04-15 05:47:58,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {24390#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24390#false} is VALID [2022-04-15 05:47:58,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {24700#(< main_~i~0 1024)} assume !(~i~0 < 1024); {24390#false} is VALID [2022-04-15 05:47:58,396 INFO L290 TraceCheckUtils]: 77: Hoare triple {24704#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24700#(< main_~i~0 1024)} is VALID [2022-04-15 05:47:58,396 INFO L290 TraceCheckUtils]: 76: Hoare triple {24704#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24704#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:58,396 INFO L290 TraceCheckUtils]: 75: Hoare triple {24711#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24704#(< main_~i~0 1023)} is VALID [2022-04-15 05:47:58,397 INFO L290 TraceCheckUtils]: 74: Hoare triple {24711#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24711#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:58,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {24718#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24711#(< main_~i~0 1022)} is VALID [2022-04-15 05:47:58,399 INFO L290 TraceCheckUtils]: 72: Hoare triple {24718#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24718#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:58,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {24725#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24718#(< main_~i~0 1021)} is VALID [2022-04-15 05:47:58,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {24725#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24725#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:58,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {24732#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24725#(< main_~i~0 1020)} is VALID [2022-04-15 05:47:58,400 INFO L290 TraceCheckUtils]: 68: Hoare triple {24732#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24732#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:58,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {24739#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24732#(< main_~i~0 1019)} is VALID [2022-04-15 05:47:58,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {24739#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24739#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:58,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {24746#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24739#(< main_~i~0 1018)} is VALID [2022-04-15 05:47:58,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {24746#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24746#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:58,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {24753#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24746#(< main_~i~0 1017)} is VALID [2022-04-15 05:47:58,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {24753#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24753#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:58,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {24760#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24753#(< main_~i~0 1016)} is VALID [2022-04-15 05:47:58,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {24760#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24760#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:58,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {24767#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24760#(< main_~i~0 1015)} is VALID [2022-04-15 05:47:58,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {24767#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24767#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:58,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {24774#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24767#(< main_~i~0 1014)} is VALID [2022-04-15 05:47:58,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {24774#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24774#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:58,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {24781#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24774#(< main_~i~0 1013)} is VALID [2022-04-15 05:47:58,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {24781#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24781#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:58,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {24788#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24781#(< main_~i~0 1012)} is VALID [2022-04-15 05:47:58,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {24788#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24788#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:58,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {24795#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24788#(< main_~i~0 1011)} is VALID [2022-04-15 05:47:58,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {24795#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24795#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:58,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {24802#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24795#(< main_~i~0 1010)} is VALID [2022-04-15 05:47:58,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {24802#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24802#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:58,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {24809#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24802#(< main_~i~0 1009)} is VALID [2022-04-15 05:47:58,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {24809#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24809#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:58,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {24816#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24809#(< main_~i~0 1008)} is VALID [2022-04-15 05:47:58,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {24816#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24816#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:58,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {24823#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24816#(< main_~i~0 1007)} is VALID [2022-04-15 05:47:58,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {24823#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24823#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:58,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {24830#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24823#(< main_~i~0 1006)} is VALID [2022-04-15 05:47:58,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {24830#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24830#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:58,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {24837#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24830#(< main_~i~0 1005)} is VALID [2022-04-15 05:47:58,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {24837#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24837#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:58,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {24844#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24837#(< main_~i~0 1004)} is VALID [2022-04-15 05:47:58,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {24844#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24844#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:58,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {24851#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24844#(< main_~i~0 1003)} is VALID [2022-04-15 05:47:58,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {24851#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24851#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:58,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {24858#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24851#(< main_~i~0 1002)} is VALID [2022-04-15 05:47:58,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {24858#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24858#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:58,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {24865#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24858#(< main_~i~0 1001)} is VALID [2022-04-15 05:47:58,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {24865#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24865#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:58,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {24872#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24865#(< main_~i~0 1000)} is VALID [2022-04-15 05:47:58,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {24872#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24872#(< main_~i~0 999)} is VALID [2022-04-15 05:47:58,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {24879#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24872#(< main_~i~0 999)} is VALID [2022-04-15 05:47:58,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {24879#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24879#(< main_~i~0 998)} is VALID [2022-04-15 05:47:58,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {24886#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24879#(< main_~i~0 998)} is VALID [2022-04-15 05:47:58,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {24886#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24886#(< main_~i~0 997)} is VALID [2022-04-15 05:47:58,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {24893#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24886#(< main_~i~0 997)} is VALID [2022-04-15 05:47:58,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {24893#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24893#(< main_~i~0 996)} is VALID [2022-04-15 05:47:58,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {24900#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24893#(< main_~i~0 996)} is VALID [2022-04-15 05:47:58,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {24900#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24900#(< main_~i~0 995)} is VALID [2022-04-15 05:47:58,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {24907#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24900#(< main_~i~0 995)} is VALID [2022-04-15 05:47:58,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {24907#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24907#(< main_~i~0 994)} is VALID [2022-04-15 05:47:58,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {24914#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24907#(< main_~i~0 994)} is VALID [2022-04-15 05:47:58,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {24914#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24914#(< main_~i~0 993)} is VALID [2022-04-15 05:47:58,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {24921#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24914#(< main_~i~0 993)} is VALID [2022-04-15 05:47:58,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {24921#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24921#(< main_~i~0 992)} is VALID [2022-04-15 05:47:58,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {24928#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24921#(< main_~i~0 992)} is VALID [2022-04-15 05:47:58,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {24928#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24928#(< main_~i~0 991)} is VALID [2022-04-15 05:47:58,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {24935#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24928#(< main_~i~0 991)} is VALID [2022-04-15 05:47:58,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {24935#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24935#(< main_~i~0 990)} is VALID [2022-04-15 05:47:58,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {24942#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24935#(< main_~i~0 990)} is VALID [2022-04-15 05:47:58,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {24942#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24942#(< main_~i~0 989)} is VALID [2022-04-15 05:47:58,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {24949#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24942#(< main_~i~0 989)} is VALID [2022-04-15 05:47:58,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {24949#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24949#(< main_~i~0 988)} is VALID [2022-04-15 05:47:58,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {24389#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {24949#(< main_~i~0 988)} is VALID [2022-04-15 05:47:58,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {24389#true} call #t~ret6 := main(); {24389#true} is VALID [2022-04-15 05:47:58,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24389#true} {24389#true} #39#return; {24389#true} is VALID [2022-04-15 05:47:58,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {24389#true} assume true; {24389#true} is VALID [2022-04-15 05:47:58,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {24389#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(12, 2);call #Ultimate.allocInit(12, 3); {24389#true} is VALID [2022-04-15 05:47:58,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {24389#true} call ULTIMATE.init(); {24389#true} is VALID [2022-04-15 05:47:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:47:58,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877802370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:47:58,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:47:58,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-15 05:47:58,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:47:58,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005416562] [2022-04-15 05:47:58,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005416562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:47:58,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:47:58,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 05:47:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120105820] [2022-04-15 05:47:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:47:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 05:47:58,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:47:58,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:58,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:58,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 05:47:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:47:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 05:47:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 05:47:58,476 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:59,574 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-15 05:47:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 05:47:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 05:47:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:47:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-15 05:47:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-15 05:47:59,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 94 transitions. [2022-04-15 05:47:59,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:47:59,655 INFO L225 Difference]: With dead ends: 94 [2022-04-15 05:47:59,655 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 05:47:59,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 05:47:59,656 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:47:59,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 29 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:47:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 05:47:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-04-15 05:47:59,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:47:59,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,950 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,950 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:59,951 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-15 05:47:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-15 05:47:59,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:59,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:59,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-15 05:47:59,951 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-15 05:47:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:47:59,952 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-15 05:47:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-15 05:47:59,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:47:59,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:47:59,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:47:59,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:47:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-04-15 05:47:59,953 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2022-04-15 05:47:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:47:59,953 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-04-15 05:47:59,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:47:59,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 87 transitions. [2022-04-15 05:48:00,042 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-15 05:48:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-15 05:48:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 05:48:00,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:48:00,042 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:48:00,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-15 05:48:00,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:00,243 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:48:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:48:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1425495100, now seen corresponding path program 73 times [2022-04-15 05:48:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532005981] [2022-04-15 05:48:00,246 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:48:00,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:48:00,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:48:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1425495100, now seen corresponding path program 74 times [2022-04-15 05:48:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:48:00,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676904003] [2022-04-15 05:48:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:48:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:48:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:48:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:00,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {25628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-15 05:48:00,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-15 05:48:00,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-15 05:48:00,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {25585#true} call ULTIMATE.init(); {25628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:48:00,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {25628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-15 05:48:00,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-15 05:48:00,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-15 05:48:00,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {25585#true} call #t~ret6 := main(); {25585#true} is VALID [2022-04-15 05:48:00,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {25585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {25590#(= main_~i~0 0)} is VALID [2022-04-15 05:48:00,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {25590#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25590#(= main_~i~0 0)} is VALID [2022-04-15 05:48:00,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {25590#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25591#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:00,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {25591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25591#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:00,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {25591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25592#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:00,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {25592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25592#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:00,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {25592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25593#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:00,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {25593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25593#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:00,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {25593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25594#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:00,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {25594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25594#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:00,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {25594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25595#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:00,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {25595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25595#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:00,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {25595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25596#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:00,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {25596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25596#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:00,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {25596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25597#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:00,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {25597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25597#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:00,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {25597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25598#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:00,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {25598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25598#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:00,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {25598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25599#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:00,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {25599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25599#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:00,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {25599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25600#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:00,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {25600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25600#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:00,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {25600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25601#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:00,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {25601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25601#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:00,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {25601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25602#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:00,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {25602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25602#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:00,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {25602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25603#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:00,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {25603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25603#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:00,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {25603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25604#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:00,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {25604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25604#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:00,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {25604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25605#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:00,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {25605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25605#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:00,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {25605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25606#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:00,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {25606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25606#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:00,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {25606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25607#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:00,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {25607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25607#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:00,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {25607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25608#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:00,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {25608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25608#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:00,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {25608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25609#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:00,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {25609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25609#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:00,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {25609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25610#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:00,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {25610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25610#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:00,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {25610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25611#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:00,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {25611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25611#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:00,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {25611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25612#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:00,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {25612#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25612#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:00,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {25612#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25613#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:00,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {25613#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25613#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:00,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {25613#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25614#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:00,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {25614#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25614#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:00,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {25614#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25615#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:00,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {25615#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25615#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:00,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {25615#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25616#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:00,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {25616#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25616#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:00,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {25616#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25617#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:00,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {25617#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25617#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:00,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {25617#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25618#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:00,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {25618#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25618#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:00,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {25618#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25619#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:00,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {25619#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25619#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:00,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {25619#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25620#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:00,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {25620#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25620#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:00,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {25620#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25621#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:00,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {25621#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25621#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:00,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {25621#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25622#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:00,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {25622#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25622#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:00,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {25622#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25623#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:00,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {25623#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25623#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:00,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {25623#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25624#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:00,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {25624#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25624#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:00,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {25624#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25625#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:00,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {25625#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25625#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:00,908 INFO L290 TraceCheckUtils]: 77: Hoare triple {25625#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25626#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:00,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {25626#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25626#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:00,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {25626#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25627#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:00,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {25627#(<= main_~i~0 37)} assume !(~i~0 < 1024); {25586#false} is VALID [2022-04-15 05:48:00,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {25586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25586#false} is VALID [2022-04-15 05:48:00,909 INFO L272 TraceCheckUtils]: 82: Hoare triple {25586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25586#false} is VALID [2022-04-15 05:48:00,909 INFO L290 TraceCheckUtils]: 83: Hoare triple {25586#false} ~cond := #in~cond; {25586#false} is VALID [2022-04-15 05:48:00,909 INFO L290 TraceCheckUtils]: 84: Hoare triple {25586#false} assume 0 == ~cond; {25586#false} is VALID [2022-04-15 05:48:00,909 INFO L290 TraceCheckUtils]: 85: Hoare triple {25586#false} assume !false; {25586#false} is VALID [2022-04-15 05:48:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:48:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676904003] [2022-04-15 05:48:00,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676904003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:48:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988737114] [2022-04-15 05:48:00,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:48:00,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:48:00,910 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:48:00,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 05:48:01,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:48:01,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:48:01,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 05:48:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:01,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:48:01,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {25585#true} call ULTIMATE.init(); {25585#true} is VALID [2022-04-15 05:48:01,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {25585#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(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-15 05:48:01,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-15 05:48:01,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-15 05:48:01,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {25585#true} call #t~ret6 := main(); {25585#true} is VALID [2022-04-15 05:48:01,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {25585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {25647#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:01,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {25647#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25647#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:01,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {25647#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25591#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:01,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {25591#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25591#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:01,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {25591#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25592#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:01,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {25592#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25592#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:01,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {25592#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25593#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:01,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {25593#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25593#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:01,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {25593#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25594#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:01,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {25594#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25594#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:01,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {25594#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25595#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:01,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {25595#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25595#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:01,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {25595#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25596#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:01,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {25596#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25596#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:01,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {25596#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25597#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:01,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {25597#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25597#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:01,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {25597#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25598#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:01,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {25598#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25598#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:01,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {25598#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25599#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:01,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {25599#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25599#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:01,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {25599#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25600#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:01,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {25600#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25600#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:01,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {25600#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25601#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:01,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {25601#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25601#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:01,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {25601#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25602#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:01,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {25602#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25602#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:01,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {25602#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25603#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:01,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {25603#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25603#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:01,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {25603#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25604#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:01,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {25604#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25604#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:01,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {25604#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25605#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:01,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {25605#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25605#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:01,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {25605#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25606#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:01,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {25606#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25606#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:01,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {25606#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25607#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:01,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {25607#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25607#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:01,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {25607#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25608#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:01,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {25608#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25608#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:01,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {25608#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25609#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:01,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {25609#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25609#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:01,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {25609#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25610#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:01,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {25610#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25610#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:01,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {25610#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25611#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:01,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {25611#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25611#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:01,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {25611#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25612#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:01,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {25612#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25612#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:01,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {25612#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25613#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:01,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {25613#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25613#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:01,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {25613#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25614#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:01,663 INFO L290 TraceCheckUtils]: 54: Hoare triple {25614#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25614#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:01,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {25614#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25615#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:01,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {25615#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25615#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:01,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {25615#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25616#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:01,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {25616#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25616#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:01,665 INFO L290 TraceCheckUtils]: 59: Hoare triple {25616#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25617#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:01,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {25617#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25617#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:01,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {25617#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25618#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:01,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {25618#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25618#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:01,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {25618#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25619#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:01,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {25619#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25619#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:01,667 INFO L290 TraceCheckUtils]: 65: Hoare triple {25619#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25620#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:01,667 INFO L290 TraceCheckUtils]: 66: Hoare triple {25620#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25620#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:01,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {25620#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25621#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:01,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {25621#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25621#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:01,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {25621#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25622#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:01,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {25622#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25622#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:01,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {25622#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25623#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:01,669 INFO L290 TraceCheckUtils]: 72: Hoare triple {25623#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25623#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:01,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {25623#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25624#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:01,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {25624#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25624#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:01,670 INFO L290 TraceCheckUtils]: 75: Hoare triple {25624#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25625#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:01,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {25625#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25625#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:01,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {25625#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25626#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:01,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {25626#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25626#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:01,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {25626#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25627#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:01,672 INFO L290 TraceCheckUtils]: 80: Hoare triple {25627#(<= main_~i~0 37)} assume !(~i~0 < 1024); {25586#false} is VALID [2022-04-15 05:48:01,672 INFO L290 TraceCheckUtils]: 81: Hoare triple {25586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25586#false} is VALID [2022-04-15 05:48:01,672 INFO L272 TraceCheckUtils]: 82: Hoare triple {25586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25586#false} is VALID [2022-04-15 05:48:01,672 INFO L290 TraceCheckUtils]: 83: Hoare triple {25586#false} ~cond := #in~cond; {25586#false} is VALID [2022-04-15 05:48:01,672 INFO L290 TraceCheckUtils]: 84: Hoare triple {25586#false} assume 0 == ~cond; {25586#false} is VALID [2022-04-15 05:48:01,672 INFO L290 TraceCheckUtils]: 85: Hoare triple {25586#false} assume !false; {25586#false} is VALID [2022-04-15 05:48:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:01,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:48:03,494 INFO L290 TraceCheckUtils]: 85: Hoare triple {25586#false} assume !false; {25586#false} is VALID [2022-04-15 05:48:03,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {25586#false} assume 0 == ~cond; {25586#false} is VALID [2022-04-15 05:48:03,494 INFO L290 TraceCheckUtils]: 83: Hoare triple {25586#false} ~cond := #in~cond; {25586#false} is VALID [2022-04-15 05:48:03,494 INFO L272 TraceCheckUtils]: 82: Hoare triple {25586#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {25586#false} is VALID [2022-04-15 05:48:03,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {25586#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25586#false} is VALID [2022-04-15 05:48:03,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {25903#(< main_~i~0 1024)} assume !(~i~0 < 1024); {25586#false} is VALID [2022-04-15 05:48:03,495 INFO L290 TraceCheckUtils]: 79: Hoare triple {25907#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25903#(< main_~i~0 1024)} is VALID [2022-04-15 05:48:03,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {25907#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25907#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:03,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {25914#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25907#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:03,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {25914#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25914#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:03,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {25921#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25914#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:03,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {25921#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25921#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:03,497 INFO L290 TraceCheckUtils]: 73: Hoare triple {25928#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25921#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:03,497 INFO L290 TraceCheckUtils]: 72: Hoare triple {25928#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25928#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:03,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {25935#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25928#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:03,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {25935#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25935#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:03,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {25942#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25935#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:03,498 INFO L290 TraceCheckUtils]: 68: Hoare triple {25942#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25942#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:03,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {25949#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25942#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:03,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {25949#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25949#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:03,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {25956#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25949#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:03,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {25956#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25956#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:03,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {25963#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25956#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:03,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {25963#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25963#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:03,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {25970#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25963#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:03,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {25970#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25970#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:03,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {25977#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25970#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:03,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {25977#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25977#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:03,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {25984#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25977#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:03,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {25984#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25984#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:03,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {25991#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25984#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:03,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {25991#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25991#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:03,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {25998#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25991#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:03,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {25998#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25998#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:03,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {26005#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {25998#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:03,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {26005#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26005#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:03,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {26012#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26005#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:03,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {26012#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26012#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:03,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {26019#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26012#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:03,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {26019#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26019#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:03,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {26026#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26019#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:03,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {26026#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26026#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:03,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {26033#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26026#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:03,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {26033#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26033#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:03,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {26040#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26033#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:03,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {26040#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26040#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:03,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {26047#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26040#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:03,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {26047#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26047#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:03,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {26054#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26047#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:03,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {26054#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26054#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:03,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {26061#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26054#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:03,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {26061#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26061#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:03,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {26068#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26061#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:03,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {26068#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26068#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:03,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {26075#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26068#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:03,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {26075#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26075#(< main_~i~0 999)} is VALID [2022-04-15 05:48:03,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {26082#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26075#(< main_~i~0 999)} is VALID [2022-04-15 05:48:03,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {26082#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26082#(< main_~i~0 998)} is VALID [2022-04-15 05:48:03,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {26089#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26082#(< main_~i~0 998)} is VALID [2022-04-15 05:48:03,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {26089#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26089#(< main_~i~0 997)} is VALID [2022-04-15 05:48:03,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {26096#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26089#(< main_~i~0 997)} is VALID [2022-04-15 05:48:03,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {26096#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26096#(< main_~i~0 996)} is VALID [2022-04-15 05:48:03,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {26103#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26096#(< main_~i~0 996)} is VALID [2022-04-15 05:48:03,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {26103#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26103#(< main_~i~0 995)} is VALID [2022-04-15 05:48:03,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {26110#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26103#(< main_~i~0 995)} is VALID [2022-04-15 05:48:03,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {26110#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26110#(< main_~i~0 994)} is VALID [2022-04-15 05:48:03,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {26117#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26110#(< main_~i~0 994)} is VALID [2022-04-15 05:48:03,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {26117#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26117#(< main_~i~0 993)} is VALID [2022-04-15 05:48:03,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {26124#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26117#(< main_~i~0 993)} is VALID [2022-04-15 05:48:03,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {26124#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26124#(< main_~i~0 992)} is VALID [2022-04-15 05:48:03,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {26131#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26124#(< main_~i~0 992)} is VALID [2022-04-15 05:48:03,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {26131#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26131#(< main_~i~0 991)} is VALID [2022-04-15 05:48:03,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {26138#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26131#(< main_~i~0 991)} is VALID [2022-04-15 05:48:03,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {26138#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26138#(< main_~i~0 990)} is VALID [2022-04-15 05:48:03,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {26145#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26138#(< main_~i~0 990)} is VALID [2022-04-15 05:48:03,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {26145#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26145#(< main_~i~0 989)} is VALID [2022-04-15 05:48:03,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {26152#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26145#(< main_~i~0 989)} is VALID [2022-04-15 05:48:03,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {26152#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26152#(< main_~i~0 988)} is VALID [2022-04-15 05:48:03,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {26159#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26152#(< main_~i~0 988)} is VALID [2022-04-15 05:48:03,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {26159#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26159#(< main_~i~0 987)} is VALID [2022-04-15 05:48:03,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {25585#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {26159#(< main_~i~0 987)} is VALID [2022-04-15 05:48:03,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {25585#true} call #t~ret6 := main(); {25585#true} is VALID [2022-04-15 05:48:03,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25585#true} {25585#true} #39#return; {25585#true} is VALID [2022-04-15 05:48:03,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {25585#true} assume true; {25585#true} is VALID [2022-04-15 05:48:03,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {25585#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(12, 2);call #Ultimate.allocInit(12, 3); {25585#true} is VALID [2022-04-15 05:48:03,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {25585#true} call ULTIMATE.init(); {25585#true} is VALID [2022-04-15 05:48:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:03,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988737114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:48:03,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:48:03,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 05:48:03,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:48:03,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532005981] [2022-04-15 05:48:03,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532005981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:48:03,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:48:03,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 05:48:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540932189] [2022-04-15 05:48:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:48:03,520 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 05:48:03,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:48:03,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:03,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:03,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 05:48:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:03,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 05:48:03,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 05:48:03,575 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:04,746 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-15 05:48:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 05:48:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 05:48:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:48:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-15 05:48:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-15 05:48:04,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 96 transitions. [2022-04-15 05:48:04,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:04,816 INFO L225 Difference]: With dead ends: 96 [2022-04-15 05:48:04,817 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 05:48:04,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 05:48:04,818 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 84 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:48:04,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 44 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:48:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 05:48:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-15 05:48:05,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:48:05,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:05,130 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:05,130 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:05,130 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-15 05:48:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-15 05:48:05,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:05,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:05,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 05:48:05,131 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 05:48:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:05,131 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-15 05:48:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-15 05:48:05,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:05,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:05,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:48:05,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:48:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-04-15 05:48:05,133 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2022-04-15 05:48:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:48:05,133 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-04-15 05:48:05,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:05,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 89 transitions. [2022-04-15 05:48:05,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-04-15 05:48:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 05:48:05,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:48:05,261 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:48:05,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 05:48:05,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 05:48:05,462 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:48:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:48:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -680311226, now seen corresponding path program 75 times [2022-04-15 05:48:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397114943] [2022-04-15 05:48:05,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:48:05,465 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:48:05,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:48:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -680311226, now seen corresponding path program 76 times [2022-04-15 05:48:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:48:05,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798601438] [2022-04-15 05:48:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:48:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:48:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:48:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:06,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {26853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-15 05:48:06,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-15 05:48:06,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-15 05:48:06,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {26809#true} call ULTIMATE.init(); {26853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:48:06,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {26853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-15 05:48:06,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-15 05:48:06,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-15 05:48:06,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {26809#true} call #t~ret6 := main(); {26809#true} is VALID [2022-04-15 05:48:06,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {26809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {26814#(= main_~i~0 0)} is VALID [2022-04-15 05:48:06,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {26814#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26814#(= main_~i~0 0)} is VALID [2022-04-15 05:48:06,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {26814#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26815#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:06,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {26815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26815#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:06,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {26815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26816#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:06,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {26816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26816#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:06,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {26816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26817#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:06,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {26817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26817#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:06,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {26817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26818#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:06,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {26818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26818#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:06,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {26818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26819#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:06,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {26819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26819#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:06,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {26819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26820#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:06,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {26820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26820#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:06,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {26820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26821#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:06,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {26821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26821#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:06,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {26821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26822#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:06,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {26822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26822#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:06,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {26822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26823#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:06,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {26823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26823#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:06,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {26823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26824#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:06,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {26824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26824#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:06,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {26824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26825#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:06,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {26825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26825#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:06,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {26825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26826#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:06,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {26826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26826#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:06,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {26826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26827#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:06,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {26827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26827#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:06,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {26827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26828#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:06,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {26828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26828#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:06,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {26828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26829#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:06,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {26829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26829#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:06,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {26829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26830#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:06,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {26830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26830#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:06,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {26830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26831#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:06,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {26831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26831#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:06,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {26831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26832#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:06,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {26832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26832#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:06,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {26832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26833#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:06,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {26833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26833#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:06,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {26833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26834#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:06,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {26834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26834#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:06,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {26834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26835#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:06,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {26835#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26835#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:06,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {26835#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26836#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:06,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {26836#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26836#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:06,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {26836#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26837#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:06,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {26837#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26837#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:06,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {26837#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26838#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:06,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {26838#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26838#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:06,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {26838#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26839#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:06,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {26839#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26839#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:06,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {26839#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26840#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:06,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {26840#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26840#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:06,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {26840#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26841#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:06,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {26841#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26841#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:06,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {26841#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26842#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:06,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {26842#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26842#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:06,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {26842#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26843#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:06,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {26843#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26843#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:06,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {26843#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26844#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:06,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {26844#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26844#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:06,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {26844#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26845#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:06,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {26845#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26845#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:06,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {26845#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26846#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:06,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {26846#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26846#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:06,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {26846#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26847#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:06,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {26847#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26847#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:06,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {26847#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26848#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:06,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {26848#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26848#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:06,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {26848#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26849#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:06,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {26849#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26849#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:06,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {26849#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26850#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:06,216 INFO L290 TraceCheckUtils]: 78: Hoare triple {26850#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26850#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:06,216 INFO L290 TraceCheckUtils]: 79: Hoare triple {26850#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26851#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:06,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {26851#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26851#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:06,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {26851#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26852#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:06,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {26852#(<= main_~i~0 38)} assume !(~i~0 < 1024); {26810#false} is VALID [2022-04-15 05:48:06,217 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {26810#false} is VALID [2022-04-15 05:48:06,217 INFO L272 TraceCheckUtils]: 84: Hoare triple {26810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {26810#false} is VALID [2022-04-15 05:48:06,217 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#false} ~cond := #in~cond; {26810#false} is VALID [2022-04-15 05:48:06,217 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#false} assume 0 == ~cond; {26810#false} is VALID [2022-04-15 05:48:06,217 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#false} assume !false; {26810#false} is VALID [2022-04-15 05:48:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:48:06,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798601438] [2022-04-15 05:48:06,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798601438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:48:06,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534503800] [2022-04-15 05:48:06,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:48:06,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:06,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:48:06,219 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:48:06,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 05:48:06,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:48:06,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:48:06,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 05:48:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:06,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:48:06,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {26809#true} call ULTIMATE.init(); {26809#true} is VALID [2022-04-15 05:48:06,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#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(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-15 05:48:06,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-15 05:48:06,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-15 05:48:06,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {26809#true} call #t~ret6 := main(); {26809#true} is VALID [2022-04-15 05:48:06,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {26809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {26872#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:06,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {26872#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26872#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:06,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {26872#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26815#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:06,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {26815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26815#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:06,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {26815#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26816#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:06,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {26816#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26816#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:06,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {26816#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26817#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:06,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {26817#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26817#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:06,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {26817#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26818#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:06,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {26818#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26818#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:06,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {26818#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26819#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:06,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {26819#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26819#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:06,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {26819#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26820#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:06,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {26820#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26820#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:06,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {26820#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26821#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:06,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {26821#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26821#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:06,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {26821#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26822#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:06,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {26822#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26822#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:06,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {26822#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26823#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:06,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {26823#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26823#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:06,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {26823#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26824#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:06,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {26824#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26824#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:06,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {26824#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26825#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:06,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {26825#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26825#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:06,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {26825#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26826#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:06,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {26826#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26826#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:06,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {26826#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26827#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:06,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {26827#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26827#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:06,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {26827#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26828#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:06,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {26828#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26828#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:06,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {26828#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26829#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:06,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {26829#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26829#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:06,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {26829#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26830#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:06,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {26830#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26830#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:06,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {26830#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26831#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:06,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {26831#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26831#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:06,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {26831#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26832#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:06,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {26832#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26832#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:06,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {26832#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26833#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:06,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {26833#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26833#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:06,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {26833#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26834#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:06,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {26834#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26834#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:06,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {26834#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26835#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:06,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {26835#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26835#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:06,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {26835#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26836#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:06,979 INFO L290 TraceCheckUtils]: 50: Hoare triple {26836#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26836#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:06,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {26836#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26837#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:06,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {26837#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26837#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:06,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {26837#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26838#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:06,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {26838#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26838#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:06,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {26838#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26839#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:06,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {26839#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26839#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:06,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {26839#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26840#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:06,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {26840#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26840#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:06,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {26840#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26841#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:06,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {26841#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26841#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:06,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {26841#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26842#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:06,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {26842#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26842#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:06,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {26842#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26843#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:06,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {26843#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26843#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:06,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {26843#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26844#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:06,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {26844#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26844#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:06,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {26844#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26845#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:06,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {26845#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26845#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:06,984 INFO L290 TraceCheckUtils]: 69: Hoare triple {26845#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26846#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:06,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {26846#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26846#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:06,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {26846#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26847#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:06,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {26847#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26847#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:06,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {26847#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26848#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:06,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {26848#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26848#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:06,986 INFO L290 TraceCheckUtils]: 75: Hoare triple {26848#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26849#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:06,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {26849#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26849#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:06,987 INFO L290 TraceCheckUtils]: 77: Hoare triple {26849#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26850#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:06,987 INFO L290 TraceCheckUtils]: 78: Hoare triple {26850#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26850#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:06,988 INFO L290 TraceCheckUtils]: 79: Hoare triple {26850#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26851#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:06,988 INFO L290 TraceCheckUtils]: 80: Hoare triple {26851#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26851#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:06,988 INFO L290 TraceCheckUtils]: 81: Hoare triple {26851#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26852#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:06,988 INFO L290 TraceCheckUtils]: 82: Hoare triple {26852#(<= main_~i~0 38)} assume !(~i~0 < 1024); {26810#false} is VALID [2022-04-15 05:48:06,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {26810#false} is VALID [2022-04-15 05:48:06,989 INFO L272 TraceCheckUtils]: 84: Hoare triple {26810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {26810#false} is VALID [2022-04-15 05:48:06,989 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#false} ~cond := #in~cond; {26810#false} is VALID [2022-04-15 05:48:06,989 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#false} assume 0 == ~cond; {26810#false} is VALID [2022-04-15 05:48:06,989 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#false} assume !false; {26810#false} is VALID [2022-04-15 05:48:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:06,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:48:08,882 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#false} assume !false; {26810#false} is VALID [2022-04-15 05:48:08,882 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#false} assume 0 == ~cond; {26810#false} is VALID [2022-04-15 05:48:08,882 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#false} ~cond := #in~cond; {26810#false} is VALID [2022-04-15 05:48:08,882 INFO L272 TraceCheckUtils]: 84: Hoare triple {26810#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {26810#false} is VALID [2022-04-15 05:48:08,882 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {26810#false} is VALID [2022-04-15 05:48:08,882 INFO L290 TraceCheckUtils]: 82: Hoare triple {27134#(< main_~i~0 1024)} assume !(~i~0 < 1024); {26810#false} is VALID [2022-04-15 05:48:08,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {27138#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27134#(< main_~i~0 1024)} is VALID [2022-04-15 05:48:08,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {27138#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27138#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:08,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {27145#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27138#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:08,883 INFO L290 TraceCheckUtils]: 78: Hoare triple {27145#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27145#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:08,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {27152#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27145#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:08,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {27152#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27152#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:08,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {27159#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27152#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:08,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {27159#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27159#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:08,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {27166#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27159#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:08,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {27166#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27166#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:08,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {27173#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27166#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:08,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {27173#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27173#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:08,887 INFO L290 TraceCheckUtils]: 69: Hoare triple {27180#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27173#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:08,887 INFO L290 TraceCheckUtils]: 68: Hoare triple {27180#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27180#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:08,888 INFO L290 TraceCheckUtils]: 67: Hoare triple {27187#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27180#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:08,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {27187#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27187#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:08,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {27194#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27187#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:08,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {27194#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27194#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:08,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {27201#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27194#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:08,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {27201#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27201#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:08,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {27208#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27201#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:08,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {27208#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27208#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:08,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {27215#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27208#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:08,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {27215#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27215#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:08,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {27222#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27215#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:08,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {27222#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27222#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:08,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {27229#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27222#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:08,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {27229#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27229#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:08,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {27236#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27229#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:08,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {27236#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27236#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:08,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {27243#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27236#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:08,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {27243#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27243#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:08,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {27250#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27243#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:08,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {27250#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27250#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:08,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {27257#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27250#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:08,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {27257#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27257#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:08,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {27264#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27257#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:08,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {27264#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27264#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:08,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {27271#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27264#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:08,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {27271#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27271#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:08,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {27278#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27271#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:08,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {27278#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27278#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:08,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {27285#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27278#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:08,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {27285#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27285#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:08,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {27292#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27285#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:08,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {27292#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27292#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:08,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {27299#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27292#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:08,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {27299#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27299#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:08,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {27306#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27299#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:08,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {27306#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27306#(< main_~i~0 999)} is VALID [2022-04-15 05:48:08,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {27313#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27306#(< main_~i~0 999)} is VALID [2022-04-15 05:48:08,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {27313#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27313#(< main_~i~0 998)} is VALID [2022-04-15 05:48:08,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {27320#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27313#(< main_~i~0 998)} is VALID [2022-04-15 05:48:08,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {27320#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27320#(< main_~i~0 997)} is VALID [2022-04-15 05:48:08,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {27327#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27320#(< main_~i~0 997)} is VALID [2022-04-15 05:48:08,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {27327#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27327#(< main_~i~0 996)} is VALID [2022-04-15 05:48:08,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {27334#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27327#(< main_~i~0 996)} is VALID [2022-04-15 05:48:08,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {27334#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27334#(< main_~i~0 995)} is VALID [2022-04-15 05:48:08,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {27341#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27334#(< main_~i~0 995)} is VALID [2022-04-15 05:48:08,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {27341#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27341#(< main_~i~0 994)} is VALID [2022-04-15 05:48:08,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {27348#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27341#(< main_~i~0 994)} is VALID [2022-04-15 05:48:08,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {27348#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27348#(< main_~i~0 993)} is VALID [2022-04-15 05:48:08,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {27355#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27348#(< main_~i~0 993)} is VALID [2022-04-15 05:48:08,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {27355#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27355#(< main_~i~0 992)} is VALID [2022-04-15 05:48:08,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {27362#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27355#(< main_~i~0 992)} is VALID [2022-04-15 05:48:08,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {27362#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27362#(< main_~i~0 991)} is VALID [2022-04-15 05:48:08,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {27369#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27362#(< main_~i~0 991)} is VALID [2022-04-15 05:48:08,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {27369#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27369#(< main_~i~0 990)} is VALID [2022-04-15 05:48:08,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {27376#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27369#(< main_~i~0 990)} is VALID [2022-04-15 05:48:08,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {27376#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27376#(< main_~i~0 989)} is VALID [2022-04-15 05:48:08,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {27383#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27376#(< main_~i~0 989)} is VALID [2022-04-15 05:48:08,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {27383#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27383#(< main_~i~0 988)} is VALID [2022-04-15 05:48:08,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {27390#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27383#(< main_~i~0 988)} is VALID [2022-04-15 05:48:08,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {27390#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27390#(< main_~i~0 987)} is VALID [2022-04-15 05:48:08,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {27397#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27390#(< main_~i~0 987)} is VALID [2022-04-15 05:48:08,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {27397#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {27397#(< main_~i~0 986)} is VALID [2022-04-15 05:48:08,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {26809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {27397#(< main_~i~0 986)} is VALID [2022-04-15 05:48:08,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {26809#true} call #t~ret6 := main(); {26809#true} is VALID [2022-04-15 05:48:08,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26809#true} {26809#true} #39#return; {26809#true} is VALID [2022-04-15 05:48:08,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {26809#true} assume true; {26809#true} is VALID [2022-04-15 05:48:08,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#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(12, 2);call #Ultimate.allocInit(12, 3); {26809#true} is VALID [2022-04-15 05:48:08,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {26809#true} call ULTIMATE.init(); {26809#true} is VALID [2022-04-15 05:48:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534503800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:48:08,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:48:08,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-15 05:48:08,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:48:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397114943] [2022-04-15 05:48:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397114943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:48:08,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:48:08,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 05:48:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043942602] [2022-04-15 05:48:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:48:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-15 05:48:08,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:48:08,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:08,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:08,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 05:48:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 05:48:08,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 05:48:08,972 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:10,195 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-15 05:48:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 05:48:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-15 05:48:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:48:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-15 05:48:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-15 05:48:10,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 98 transitions. [2022-04-15 05:48:10,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:10,267 INFO L225 Difference]: With dead ends: 98 [2022-04-15 05:48:10,267 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 05:48:10,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6402, Invalid=8118, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 05:48:10,268 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:48:10,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 44 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:48:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 05:48:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-15 05:48:10,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:48:10,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,595 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,595 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:10,596 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-15 05:48:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-15 05:48:10,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:10,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:10,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-15 05:48:10,596 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-15 05:48:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:10,597 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-15 05:48:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-15 05:48:10,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:10,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:10,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:48:10,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:48:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-04-15 05:48:10,598 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2022-04-15 05:48:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:48:10,599 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-04-15 05:48:10,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:10,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 91 transitions. [2022-04-15 05:48:10,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-15 05:48:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 05:48:10,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:48:10,692 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:48:10,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 05:48:10,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 05:48:10,896 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:48:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:48:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1818146744, now seen corresponding path program 77 times [2022-04-15 05:48:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:10,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234858188] [2022-04-15 05:48:10,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:48:10,900 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:48:10,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:48:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1818146744, now seen corresponding path program 78 times [2022-04-15 05:48:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:48:10,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325235463] [2022-04-15 05:48:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:48:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:48:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:48:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:11,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {28106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-15 05:48:11,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-15 05:48:11,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-15 05:48:11,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {28061#true} call ULTIMATE.init(); {28106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:48:11,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {28106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-15 05:48:11,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-15 05:48:11,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-15 05:48:11,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {28061#true} call #t~ret6 := main(); {28061#true} is VALID [2022-04-15 05:48:11,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {28061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {28066#(= main_~i~0 0)} is VALID [2022-04-15 05:48:11,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {28066#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28066#(= main_~i~0 0)} is VALID [2022-04-15 05:48:11,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {28066#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28067#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:11,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {28067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28067#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:11,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {28067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28068#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:11,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {28068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28068#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:11,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {28068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28069#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:11,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {28069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28069#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:11,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {28069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28070#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:11,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {28070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28070#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:11,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {28070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28071#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:11,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {28071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28071#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:11,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {28071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28072#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:11,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {28072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28072#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:11,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {28072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28073#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:11,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {28073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28073#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:11,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {28073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28074#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:11,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {28074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28074#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:11,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {28074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28075#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:11,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {28075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28075#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:11,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {28075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28076#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:11,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {28076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28076#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:11,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {28076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28077#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:11,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {28077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28077#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:11,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {28077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28078#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:11,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {28078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28078#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:11,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {28078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28079#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:11,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {28079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28079#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:11,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {28079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28080#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:11,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {28080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28080#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:11,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {28080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28081#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:11,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {28081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28081#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:11,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {28081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28082#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:11,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {28082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28082#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:11,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {28082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28083#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:11,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {28083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28083#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:11,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {28083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28084#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:11,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {28084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28084#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:11,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {28084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28085#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:11,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {28085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28085#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:11,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {28085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28086#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:11,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {28086#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28086#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:11,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {28086#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28087#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:11,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {28087#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28087#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:11,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {28087#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28088#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:11,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {28088#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28088#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:11,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {28088#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28089#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:11,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {28089#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28089#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:11,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {28089#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28090#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:11,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {28090#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28090#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:11,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {28090#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28091#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:11,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {28091#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28091#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:11,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {28091#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28092#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:11,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {28092#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28092#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:11,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {28092#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28093#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:11,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {28093#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28093#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:11,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {28093#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28094#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:11,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {28094#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28094#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:11,580 INFO L290 TraceCheckUtils]: 63: Hoare triple {28094#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28095#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:11,580 INFO L290 TraceCheckUtils]: 64: Hoare triple {28095#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28095#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:11,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {28095#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28096#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:11,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {28096#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28096#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:11,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {28096#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28097#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:11,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {28097#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28097#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:11,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {28097#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:11,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {28098#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28098#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:11,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {28098#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28099#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:11,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28099#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:11,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28100#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:11,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {28100#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28100#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:11,584 INFO L290 TraceCheckUtils]: 75: Hoare triple {28100#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28101#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:11,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {28101#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28101#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:11,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {28101#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28102#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:11,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {28102#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28102#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:11,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {28102#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28103#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:11,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {28103#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28103#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:11,586 INFO L290 TraceCheckUtils]: 81: Hoare triple {28103#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28104#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:11,586 INFO L290 TraceCheckUtils]: 82: Hoare triple {28104#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28104#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:11,586 INFO L290 TraceCheckUtils]: 83: Hoare triple {28104#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28105#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:11,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {28105#(<= main_~i~0 39)} assume !(~i~0 < 1024); {28062#false} is VALID [2022-04-15 05:48:11,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {28062#false} is VALID [2022-04-15 05:48:11,587 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {28062#false} is VALID [2022-04-15 05:48:11,587 INFO L290 TraceCheckUtils]: 87: Hoare triple {28062#false} ~cond := #in~cond; {28062#false} is VALID [2022-04-15 05:48:11,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {28062#false} assume 0 == ~cond; {28062#false} is VALID [2022-04-15 05:48:11,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {28062#false} assume !false; {28062#false} is VALID [2022-04-15 05:48:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:48:11,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325235463] [2022-04-15 05:48:11,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325235463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:48:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951147553] [2022-04-15 05:48:11,588 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:48:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:48:11,592 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:48:11,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 05:48:28,172 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-15 05:48:28,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:48:28,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 05:48:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:28,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:48:28,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {28061#true} call ULTIMATE.init(); {28061#true} is VALID [2022-04-15 05:48:28,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {28061#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(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-15 05:48:28,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-15 05:48:28,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-15 05:48:28,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {28061#true} call #t~ret6 := main(); {28061#true} is VALID [2022-04-15 05:48:28,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {28061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {28125#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:28,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {28125#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28125#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:28,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {28125#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28067#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:28,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {28067#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28067#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:28,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {28067#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28068#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:28,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {28068#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28068#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:28,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {28068#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28069#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:28,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {28069#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28069#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:28,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {28069#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28070#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:28,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {28070#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28070#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:28,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {28070#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28071#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:28,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {28071#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28071#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:28,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {28071#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28072#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:28,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {28072#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28072#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:28,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {28072#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28073#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:28,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {28073#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28073#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:28,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {28073#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28074#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:28,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {28074#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28074#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:28,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {28074#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28075#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:28,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {28075#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28075#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:28,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {28075#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28076#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:28,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {28076#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28076#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:28,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {28076#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28077#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:28,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {28077#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28077#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:28,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {28077#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28078#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:28,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {28078#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28078#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:28,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {28078#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28079#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:28,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {28079#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28079#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:28,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {28079#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28080#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:28,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {28080#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28080#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:28,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {28080#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28081#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:28,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {28081#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28081#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:28,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {28081#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28082#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:28,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {28082#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28082#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:28,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {28082#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28083#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:28,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {28083#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28083#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:28,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {28083#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28084#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:28,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {28084#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28084#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:28,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {28084#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28085#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:28,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {28085#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28085#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:28,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {28085#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28086#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:28,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {28086#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28086#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:28,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {28086#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28087#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:28,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {28087#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28087#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:28,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {28087#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28088#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:28,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {28088#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28088#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:28,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {28088#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28089#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:28,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {28089#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28089#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:28,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {28089#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28090#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:28,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {28090#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28090#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:28,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {28090#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28091#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:28,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {28091#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28091#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:28,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {28091#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28092#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:28,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {28092#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28092#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:28,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {28092#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28093#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:28,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {28093#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28093#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:28,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {28093#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28094#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:28,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {28094#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28094#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:28,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {28094#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28095#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:28,738 INFO L290 TraceCheckUtils]: 64: Hoare triple {28095#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28095#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:28,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {28095#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28096#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:28,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {28096#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28096#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:28,739 INFO L290 TraceCheckUtils]: 67: Hoare triple {28096#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28097#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:28,739 INFO L290 TraceCheckUtils]: 68: Hoare triple {28097#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28097#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:28,739 INFO L290 TraceCheckUtils]: 69: Hoare triple {28097#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28098#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:28,739 INFO L290 TraceCheckUtils]: 70: Hoare triple {28098#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28098#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:28,740 INFO L290 TraceCheckUtils]: 71: Hoare triple {28098#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28099#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:28,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {28099#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28099#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:28,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {28099#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28100#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:28,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {28100#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28100#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:28,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {28100#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28101#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:28,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {28101#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28101#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:28,742 INFO L290 TraceCheckUtils]: 77: Hoare triple {28101#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28102#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:28,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {28102#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28102#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:28,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {28102#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28103#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:28,743 INFO L290 TraceCheckUtils]: 80: Hoare triple {28103#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28103#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:28,743 INFO L290 TraceCheckUtils]: 81: Hoare triple {28103#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28104#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:28,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {28104#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28104#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:28,744 INFO L290 TraceCheckUtils]: 83: Hoare triple {28104#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28105#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:28,744 INFO L290 TraceCheckUtils]: 84: Hoare triple {28105#(<= main_~i~0 39)} assume !(~i~0 < 1024); {28062#false} is VALID [2022-04-15 05:48:28,744 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {28062#false} is VALID [2022-04-15 05:48:28,744 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {28062#false} is VALID [2022-04-15 05:48:28,744 INFO L290 TraceCheckUtils]: 87: Hoare triple {28062#false} ~cond := #in~cond; {28062#false} is VALID [2022-04-15 05:48:28,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {28062#false} assume 0 == ~cond; {28062#false} is VALID [2022-04-15 05:48:28,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {28062#false} assume !false; {28062#false} is VALID [2022-04-15 05:48:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:28,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:48:30,713 INFO L290 TraceCheckUtils]: 89: Hoare triple {28062#false} assume !false; {28062#false} is VALID [2022-04-15 05:48:30,713 INFO L290 TraceCheckUtils]: 88: Hoare triple {28062#false} assume 0 == ~cond; {28062#false} is VALID [2022-04-15 05:48:30,713 INFO L290 TraceCheckUtils]: 87: Hoare triple {28062#false} ~cond := #in~cond; {28062#false} is VALID [2022-04-15 05:48:30,713 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {28062#false} is VALID [2022-04-15 05:48:30,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {28062#false} is VALID [2022-04-15 05:48:30,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {28393#(< main_~i~0 1024)} assume !(~i~0 < 1024); {28062#false} is VALID [2022-04-15 05:48:30,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {28397#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28393#(< main_~i~0 1024)} is VALID [2022-04-15 05:48:30,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {28397#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28397#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:30,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {28404#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28397#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:30,715 INFO L290 TraceCheckUtils]: 80: Hoare triple {28404#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28404#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:30,715 INFO L290 TraceCheckUtils]: 79: Hoare triple {28411#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28404#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:30,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {28411#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28411#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:30,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {28418#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28411#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:30,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {28418#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28418#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:30,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {28425#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28418#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:30,717 INFO L290 TraceCheckUtils]: 74: Hoare triple {28425#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28425#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:30,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {28432#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28425#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:30,718 INFO L290 TraceCheckUtils]: 72: Hoare triple {28432#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28432#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:30,718 INFO L290 TraceCheckUtils]: 71: Hoare triple {28439#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28432#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:30,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {28439#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28439#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:30,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {28446#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28439#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:30,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {28446#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28446#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:30,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {28453#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28446#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:30,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {28453#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28453#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:30,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {28460#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28453#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:30,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {28460#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28460#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:30,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {28467#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28460#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:30,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {28467#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28467#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:30,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {28474#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28467#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:30,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {28474#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28474#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:30,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {28481#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28474#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:30,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {28481#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28481#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:30,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {28488#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28481#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:30,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {28488#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28488#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:30,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {28495#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28488#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:30,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {28495#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28495#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:30,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {28502#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28495#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:30,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {28502#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28502#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:30,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {28509#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28502#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:30,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {28509#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28509#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:30,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {28516#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28509#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:30,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {28516#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28516#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:30,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {28523#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28516#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:30,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {28523#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28523#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:30,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {28530#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28523#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:30,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {28530#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28530#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:30,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {28537#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28530#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:30,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {28537#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28537#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:30,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {28544#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28537#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:30,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {28544#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28544#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:30,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {28551#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28544#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:30,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {28551#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28551#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:30,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {28558#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28551#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:30,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {28558#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28558#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:30,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {28565#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28558#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:30,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {28565#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28565#(< main_~i~0 999)} is VALID [2022-04-15 05:48:30,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {28572#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28565#(< main_~i~0 999)} is VALID [2022-04-15 05:48:30,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {28572#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28572#(< main_~i~0 998)} is VALID [2022-04-15 05:48:30,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {28579#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28572#(< main_~i~0 998)} is VALID [2022-04-15 05:48:30,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {28579#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28579#(< main_~i~0 997)} is VALID [2022-04-15 05:48:30,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {28586#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28579#(< main_~i~0 997)} is VALID [2022-04-15 05:48:30,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {28586#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28586#(< main_~i~0 996)} is VALID [2022-04-15 05:48:30,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {28593#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28586#(< main_~i~0 996)} is VALID [2022-04-15 05:48:30,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {28593#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28593#(< main_~i~0 995)} is VALID [2022-04-15 05:48:30,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {28600#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28593#(< main_~i~0 995)} is VALID [2022-04-15 05:48:30,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {28600#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28600#(< main_~i~0 994)} is VALID [2022-04-15 05:48:30,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {28607#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28600#(< main_~i~0 994)} is VALID [2022-04-15 05:48:30,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {28607#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28607#(< main_~i~0 993)} is VALID [2022-04-15 05:48:30,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {28614#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28607#(< main_~i~0 993)} is VALID [2022-04-15 05:48:30,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {28614#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28614#(< main_~i~0 992)} is VALID [2022-04-15 05:48:30,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {28621#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28614#(< main_~i~0 992)} is VALID [2022-04-15 05:48:30,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {28621#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28621#(< main_~i~0 991)} is VALID [2022-04-15 05:48:30,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {28628#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28621#(< main_~i~0 991)} is VALID [2022-04-15 05:48:30,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {28628#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28628#(< main_~i~0 990)} is VALID [2022-04-15 05:48:30,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {28635#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28628#(< main_~i~0 990)} is VALID [2022-04-15 05:48:30,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {28635#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28635#(< main_~i~0 989)} is VALID [2022-04-15 05:48:30,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {28642#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28635#(< main_~i~0 989)} is VALID [2022-04-15 05:48:30,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {28642#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28642#(< main_~i~0 988)} is VALID [2022-04-15 05:48:30,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {28649#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28642#(< main_~i~0 988)} is VALID [2022-04-15 05:48:30,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {28649#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28649#(< main_~i~0 987)} is VALID [2022-04-15 05:48:30,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {28656#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28649#(< main_~i~0 987)} is VALID [2022-04-15 05:48:30,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {28656#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28656#(< main_~i~0 986)} is VALID [2022-04-15 05:48:30,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {28663#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {28656#(< main_~i~0 986)} is VALID [2022-04-15 05:48:30,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {28663#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28663#(< main_~i~0 985)} is VALID [2022-04-15 05:48:30,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {28061#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {28663#(< main_~i~0 985)} is VALID [2022-04-15 05:48:30,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {28061#true} call #t~ret6 := main(); {28061#true} is VALID [2022-04-15 05:48:30,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28061#true} {28061#true} #39#return; {28061#true} is VALID [2022-04-15 05:48:30,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {28061#true} assume true; {28061#true} is VALID [2022-04-15 05:48:30,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {28061#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(12, 2);call #Ultimate.allocInit(12, 3); {28061#true} is VALID [2022-04-15 05:48:30,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {28061#true} call ULTIMATE.init(); {28061#true} is VALID [2022-04-15 05:48:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951147553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:48:30,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:48:30,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-15 05:48:30,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:48:30,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234858188] [2022-04-15 05:48:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234858188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:48:30,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:48:30,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 05:48:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644125481] [2022-04-15 05:48:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:48:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 05:48:30,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:48:30,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:30,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:30,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 05:48:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 05:48:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 05:48:30,800 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:32,045 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-15 05:48:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 05:48:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 05:48:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:48:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-15 05:48:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-15 05:48:32,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 100 transitions. [2022-04-15 05:48:32,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:32,138 INFO L225 Difference]: With dead ends: 100 [2022-04-15 05:48:32,138 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 05:48:32,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 05:48:32,140 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:48:32,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 29 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:48:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 05:48:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-04-15 05:48:32,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:48:32,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,486 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,486 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:32,487 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-15 05:48:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-15 05:48:32,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:32,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:32,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 05:48:32,488 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 05:48:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:32,488 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-15 05:48:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-15 05:48:32,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:32,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:32,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:48:32,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:48:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2022-04-15 05:48:32,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2022-04-15 05:48:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:48:32,490 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2022-04-15 05:48:32,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:32,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 93 transitions. [2022-04-15 05:48:32,589 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-15 05:48:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2022-04-15 05:48:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 05:48:32,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:48:32,589 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:48:32,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-15 05:48:32,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 05:48:32,790 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:48:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:48:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash -61419062, now seen corresponding path program 79 times [2022-04-15 05:48:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:32,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933650348] [2022-04-15 05:48:32,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:48:32,793 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:48:32,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:48:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash -61419062, now seen corresponding path program 80 times [2022-04-15 05:48:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:48:32,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042816279] [2022-04-15 05:48:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:48:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:48:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:48:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:33,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {29387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-15 05:48:33,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-15 05:48:33,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-15 05:48:33,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {29341#true} call ULTIMATE.init(); {29387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:48:33,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {29387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-15 05:48:33,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-15 05:48:33,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-15 05:48:33,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {29341#true} call #t~ret6 := main(); {29341#true} is VALID [2022-04-15 05:48:33,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {29341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29346#(= main_~i~0 0)} is VALID [2022-04-15 05:48:33,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {29346#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29346#(= main_~i~0 0)} is VALID [2022-04-15 05:48:33,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {29346#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29347#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:33,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {29347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29347#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:33,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {29347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29348#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:33,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {29348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29348#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:33,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {29348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29349#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:33,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {29349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29349#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:33,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {29349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29350#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:33,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {29350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29350#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:33,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {29350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29351#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:33,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {29351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29351#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:33,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {29351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29352#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:33,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {29352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29352#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:33,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {29352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29353#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:33,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {29353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29353#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:33,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {29353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29354#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:33,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {29354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29354#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:33,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {29354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29355#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:33,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {29355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29355#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:33,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {29355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29356#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:33,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {29356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29356#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:33,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {29356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29357#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:33,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {29357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29357#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:33,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {29357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29358#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:33,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {29358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29358#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:33,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {29358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29359#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:33,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {29359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29359#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:33,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {29359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29360#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:33,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {29360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29360#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:33,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {29360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29361#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:33,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {29361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29361#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:33,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {29361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29362#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:33,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {29362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29362#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:33,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {29362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29363#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:33,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {29363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29363#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:33,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {29363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29364#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:33,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {29364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29364#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:33,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {29364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29365#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:33,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {29365#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29365#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:33,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {29365#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29366#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:33,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {29366#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29366#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:33,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {29366#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29367#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:33,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {29367#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29367#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:33,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {29367#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29368#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:33,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {29368#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29368#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:33,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {29368#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29369#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:33,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {29369#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29369#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:33,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {29369#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29370#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:33,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {29370#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29370#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:33,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {29370#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29371#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:33,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {29371#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29371#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:33,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {29371#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29372#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:33,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {29372#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29372#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:33,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {29372#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29373#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:33,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {29373#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29373#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:33,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {29373#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29374#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:33,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {29374#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29374#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:33,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {29374#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29375#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:33,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {29375#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29375#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:33,478 INFO L290 TraceCheckUtils]: 65: Hoare triple {29375#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29376#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:33,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {29376#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29376#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:33,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {29376#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29377#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:33,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {29377#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29377#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:33,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {29377#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29378#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:33,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {29378#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29378#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:33,479 INFO L290 TraceCheckUtils]: 71: Hoare triple {29378#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29379#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:33,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {29379#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29379#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:33,480 INFO L290 TraceCheckUtils]: 73: Hoare triple {29379#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29380#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:33,480 INFO L290 TraceCheckUtils]: 74: Hoare triple {29380#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29380#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:33,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {29380#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29381#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:33,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {29381#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29381#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:33,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {29381#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29382#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:33,482 INFO L290 TraceCheckUtils]: 78: Hoare triple {29382#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29382#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:33,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {29382#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29383#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:33,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {29383#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29383#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:33,482 INFO L290 TraceCheckUtils]: 81: Hoare triple {29383#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29384#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:33,483 INFO L290 TraceCheckUtils]: 82: Hoare triple {29384#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29384#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:33,483 INFO L290 TraceCheckUtils]: 83: Hoare triple {29384#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29385#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:33,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {29385#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29385#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:33,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {29385#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29386#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:33,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {29386#(<= main_~i~0 40)} assume !(~i~0 < 1024); {29342#false} is VALID [2022-04-15 05:48:33,484 INFO L290 TraceCheckUtils]: 87: Hoare triple {29342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {29342#false} is VALID [2022-04-15 05:48:33,484 INFO L272 TraceCheckUtils]: 88: Hoare triple {29342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {29342#false} is VALID [2022-04-15 05:48:33,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {29342#false} ~cond := #in~cond; {29342#false} is VALID [2022-04-15 05:48:33,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {29342#false} assume 0 == ~cond; {29342#false} is VALID [2022-04-15 05:48:33,484 INFO L290 TraceCheckUtils]: 91: Hoare triple {29342#false} assume !false; {29342#false} is VALID [2022-04-15 05:48:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:48:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042816279] [2022-04-15 05:48:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042816279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:48:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594936114] [2022-04-15 05:48:33,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:48:33,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:33,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:48:33,486 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:48:33,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 05:48:33,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:48:33,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:48:33,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 05:48:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:33,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:48:34,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {29341#true} call ULTIMATE.init(); {29341#true} is VALID [2022-04-15 05:48:34,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {29341#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(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-15 05:48:34,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-15 05:48:34,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-15 05:48:34,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {29341#true} call #t~ret6 := main(); {29341#true} is VALID [2022-04-15 05:48:34,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {29341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29406#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:34,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {29406#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29406#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:34,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {29406#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29347#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:34,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {29347#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29347#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:34,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {29347#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29348#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:34,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {29348#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29348#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:34,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {29348#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29349#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:34,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {29349#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29349#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:34,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {29349#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29350#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:34,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {29350#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29350#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:34,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {29350#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29351#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:34,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {29351#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29351#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:34,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {29351#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29352#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:34,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {29352#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29352#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:34,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {29352#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29353#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:34,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {29353#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29353#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:34,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {29353#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29354#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:34,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {29354#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29354#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:34,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {29354#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29355#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:34,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {29355#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29355#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:34,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {29355#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29356#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:34,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {29356#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29356#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:34,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {29356#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29357#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:34,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {29357#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29357#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:34,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {29357#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29358#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:34,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {29358#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29358#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:34,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {29358#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29359#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:34,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {29359#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29359#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:34,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {29359#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29360#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:34,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {29360#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29360#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:34,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {29360#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29361#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:34,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {29361#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29361#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:34,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {29361#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29362#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:34,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {29362#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29362#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:34,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {29362#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29363#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:34,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {29363#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29363#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:34,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {29363#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29364#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:34,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {29364#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29364#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:34,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {29364#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29365#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:34,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {29365#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29365#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:34,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {29365#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29366#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:34,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {29366#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29366#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:34,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {29366#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29367#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:34,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {29367#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29367#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:34,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {29367#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29368#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:34,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {29368#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29368#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:34,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {29368#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29369#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:34,240 INFO L290 TraceCheckUtils]: 52: Hoare triple {29369#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29369#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:34,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {29369#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29370#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:34,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {29370#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29370#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:34,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {29370#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29371#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:34,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {29371#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29371#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:34,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {29371#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29372#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:34,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {29372#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29372#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:34,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {29372#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29373#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:34,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {29373#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29373#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:34,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {29373#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29374#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:34,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {29374#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29374#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:34,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {29374#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29375#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:34,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {29375#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29375#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:34,245 INFO L290 TraceCheckUtils]: 65: Hoare triple {29375#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29376#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:34,245 INFO L290 TraceCheckUtils]: 66: Hoare triple {29376#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29376#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:34,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {29376#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29377#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:34,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {29377#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29377#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:34,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {29377#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29378#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:34,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {29378#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29378#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:34,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {29378#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29379#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:34,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {29379#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29379#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:34,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {29379#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29380#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:34,247 INFO L290 TraceCheckUtils]: 74: Hoare triple {29380#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29380#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:34,248 INFO L290 TraceCheckUtils]: 75: Hoare triple {29380#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29381#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:34,248 INFO L290 TraceCheckUtils]: 76: Hoare triple {29381#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29381#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:34,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {29381#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29382#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:34,248 INFO L290 TraceCheckUtils]: 78: Hoare triple {29382#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29382#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:34,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {29382#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29383#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:34,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {29383#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29383#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:34,249 INFO L290 TraceCheckUtils]: 81: Hoare triple {29383#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29384#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:34,250 INFO L290 TraceCheckUtils]: 82: Hoare triple {29384#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29384#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:34,250 INFO L290 TraceCheckUtils]: 83: Hoare triple {29384#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29385#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:34,250 INFO L290 TraceCheckUtils]: 84: Hoare triple {29385#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29385#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:34,251 INFO L290 TraceCheckUtils]: 85: Hoare triple {29385#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29386#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:34,251 INFO L290 TraceCheckUtils]: 86: Hoare triple {29386#(<= main_~i~0 40)} assume !(~i~0 < 1024); {29342#false} is VALID [2022-04-15 05:48:34,251 INFO L290 TraceCheckUtils]: 87: Hoare triple {29342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {29342#false} is VALID [2022-04-15 05:48:34,251 INFO L272 TraceCheckUtils]: 88: Hoare triple {29342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {29342#false} is VALID [2022-04-15 05:48:34,251 INFO L290 TraceCheckUtils]: 89: Hoare triple {29342#false} ~cond := #in~cond; {29342#false} is VALID [2022-04-15 05:48:34,251 INFO L290 TraceCheckUtils]: 90: Hoare triple {29342#false} assume 0 == ~cond; {29342#false} is VALID [2022-04-15 05:48:34,251 INFO L290 TraceCheckUtils]: 91: Hoare triple {29342#false} assume !false; {29342#false} is VALID [2022-04-15 05:48:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:34,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:48:36,308 INFO L290 TraceCheckUtils]: 91: Hoare triple {29342#false} assume !false; {29342#false} is VALID [2022-04-15 05:48:36,308 INFO L290 TraceCheckUtils]: 90: Hoare triple {29342#false} assume 0 == ~cond; {29342#false} is VALID [2022-04-15 05:48:36,308 INFO L290 TraceCheckUtils]: 89: Hoare triple {29342#false} ~cond := #in~cond; {29342#false} is VALID [2022-04-15 05:48:36,308 INFO L272 TraceCheckUtils]: 88: Hoare triple {29342#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {29342#false} is VALID [2022-04-15 05:48:36,308 INFO L290 TraceCheckUtils]: 87: Hoare triple {29342#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {29342#false} is VALID [2022-04-15 05:48:36,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {29680#(< main_~i~0 1024)} assume !(~i~0 < 1024); {29342#false} is VALID [2022-04-15 05:48:36,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {29684#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29680#(< main_~i~0 1024)} is VALID [2022-04-15 05:48:36,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {29684#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29684#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:36,310 INFO L290 TraceCheckUtils]: 83: Hoare triple {29691#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29684#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:36,310 INFO L290 TraceCheckUtils]: 82: Hoare triple {29691#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29691#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:36,310 INFO L290 TraceCheckUtils]: 81: Hoare triple {29698#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29691#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:36,310 INFO L290 TraceCheckUtils]: 80: Hoare triple {29698#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29698#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:36,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {29705#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29698#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:36,311 INFO L290 TraceCheckUtils]: 78: Hoare triple {29705#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29705#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:36,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {29712#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29705#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:36,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {29712#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29712#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:36,312 INFO L290 TraceCheckUtils]: 75: Hoare triple {29719#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29712#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:36,312 INFO L290 TraceCheckUtils]: 74: Hoare triple {29719#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29719#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:36,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {29726#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29719#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:36,313 INFO L290 TraceCheckUtils]: 72: Hoare triple {29726#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29726#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:36,313 INFO L290 TraceCheckUtils]: 71: Hoare triple {29733#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29726#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:36,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {29733#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29733#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:36,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {29740#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29733#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:36,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {29740#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29740#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:36,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {29747#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29740#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:36,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {29747#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29747#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:36,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {29754#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29747#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:36,316 INFO L290 TraceCheckUtils]: 64: Hoare triple {29754#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29754#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:36,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {29761#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29754#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:36,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {29761#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29761#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:36,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {29768#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29761#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:36,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {29768#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29768#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:36,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {29775#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29768#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:36,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {29775#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29775#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:36,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {29782#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29775#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:36,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {29782#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29782#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:36,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {29789#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29782#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:36,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {29789#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29789#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:36,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {29796#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29789#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:36,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {29796#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29796#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:36,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {29803#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29796#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:36,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {29803#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29803#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:36,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {29810#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29803#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:36,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {29810#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29810#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:36,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {29817#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29810#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:36,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {29817#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:36,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {29824#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29817#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:36,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {29824#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29824#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:36,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {29831#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29824#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:36,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {29831#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29831#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:36,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29831#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:36,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29838#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:36,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {29845#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29838#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:36,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {29845#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29845#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:36,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {29852#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29845#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:36,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {29852#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29852#(< main_~i~0 999)} is VALID [2022-04-15 05:48:36,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {29859#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29852#(< main_~i~0 999)} is VALID [2022-04-15 05:48:36,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {29859#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29859#(< main_~i~0 998)} is VALID [2022-04-15 05:48:36,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {29866#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29859#(< main_~i~0 998)} is VALID [2022-04-15 05:48:36,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {29866#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29866#(< main_~i~0 997)} is VALID [2022-04-15 05:48:36,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {29873#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29866#(< main_~i~0 997)} is VALID [2022-04-15 05:48:36,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {29873#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29873#(< main_~i~0 996)} is VALID [2022-04-15 05:48:36,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {29880#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29873#(< main_~i~0 996)} is VALID [2022-04-15 05:48:36,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {29880#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29880#(< main_~i~0 995)} is VALID [2022-04-15 05:48:36,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {29887#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29880#(< main_~i~0 995)} is VALID [2022-04-15 05:48:36,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {29887#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29887#(< main_~i~0 994)} is VALID [2022-04-15 05:48:36,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {29894#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29887#(< main_~i~0 994)} is VALID [2022-04-15 05:48:36,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {29894#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29894#(< main_~i~0 993)} is VALID [2022-04-15 05:48:36,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {29901#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29894#(< main_~i~0 993)} is VALID [2022-04-15 05:48:36,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {29901#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29901#(< main_~i~0 992)} is VALID [2022-04-15 05:48:36,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {29908#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29901#(< main_~i~0 992)} is VALID [2022-04-15 05:48:36,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {29908#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29908#(< main_~i~0 991)} is VALID [2022-04-15 05:48:36,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {29915#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29908#(< main_~i~0 991)} is VALID [2022-04-15 05:48:36,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {29915#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29915#(< main_~i~0 990)} is VALID [2022-04-15 05:48:36,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {29922#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29915#(< main_~i~0 990)} is VALID [2022-04-15 05:48:36,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {29922#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29922#(< main_~i~0 989)} is VALID [2022-04-15 05:48:36,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {29929#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29922#(< main_~i~0 989)} is VALID [2022-04-15 05:48:36,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {29929#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29929#(< main_~i~0 988)} is VALID [2022-04-15 05:48:36,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {29936#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29929#(< main_~i~0 988)} is VALID [2022-04-15 05:48:36,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {29936#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29936#(< main_~i~0 987)} is VALID [2022-04-15 05:48:36,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {29943#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29936#(< main_~i~0 987)} is VALID [2022-04-15 05:48:36,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {29943#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29943#(< main_~i~0 986)} is VALID [2022-04-15 05:48:36,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {29950#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29943#(< main_~i~0 986)} is VALID [2022-04-15 05:48:36,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {29950#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29950#(< main_~i~0 985)} is VALID [2022-04-15 05:48:36,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {29957#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29950#(< main_~i~0 985)} is VALID [2022-04-15 05:48:36,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {29957#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29957#(< main_~i~0 984)} is VALID [2022-04-15 05:48:36,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {29341#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29957#(< main_~i~0 984)} is VALID [2022-04-15 05:48:36,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {29341#true} call #t~ret6 := main(); {29341#true} is VALID [2022-04-15 05:48:36,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29341#true} {29341#true} #39#return; {29341#true} is VALID [2022-04-15 05:48:36,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {29341#true} assume true; {29341#true} is VALID [2022-04-15 05:48:36,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {29341#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(12, 2);call #Ultimate.allocInit(12, 3); {29341#true} is VALID [2022-04-15 05:48:36,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {29341#true} call ULTIMATE.init(); {29341#true} is VALID [2022-04-15 05:48:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594936114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:48:36,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:48:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 05:48:36,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:48:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933650348] [2022-04-15 05:48:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933650348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:48:36,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:48:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 05:48:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223026518] [2022-04-15 05:48:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:48:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 05:48:36,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:48:36,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:36,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:36,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 05:48:36,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 05:48:36,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 05:48:36,394 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:37,723 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-15 05:48:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 05:48:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 05:48:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:48:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-15 05:48:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-15 05:48:37,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 102 transitions. [2022-04-15 05:48:37,806 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-15 05:48:37,807 INFO L225 Difference]: With dead ends: 102 [2022-04-15 05:48:37,807 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 05:48:37,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 05:48:37,809 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:48:37,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 39 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:48:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 05:48:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-04-15 05:48:38,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:48:38,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:38,170 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:38,170 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:38,171 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-15 05:48:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-15 05:48:38,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:38,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:38,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-15 05:48:38,171 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-15 05:48:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:38,172 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-15 05:48:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-15 05:48:38,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:38,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:38,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:48:38,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:48:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2022-04-15 05:48:38,174 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2022-04-15 05:48:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:48:38,174 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2022-04-15 05:48:38,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:38,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 95 transitions. [2022-04-15 05:48:38,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-15 05:48:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 05:48:38,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:48:38,324 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:48:38,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-15 05:48:38,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-15 05:48:38,524 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:48:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:48:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 231736012, now seen corresponding path program 81 times [2022-04-15 05:48:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:38,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498806291] [2022-04-15 05:48:38,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:48:38,527 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:48:38,527 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:48:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 231736012, now seen corresponding path program 82 times [2022-04-15 05:48:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:48:38,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524897509] [2022-04-15 05:48:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:48:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:48:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:48:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:39,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {30696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {30649#true} call ULTIMATE.init(); {30696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:48:39,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {30696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {30649#true} call #t~ret6 := main(); {30649#true} is VALID [2022-04-15 05:48:39,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {30649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {30654#(= main_~i~0 0)} is VALID [2022-04-15 05:48:39,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {30654#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30654#(= main_~i~0 0)} is VALID [2022-04-15 05:48:39,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {30654#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30655#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:39,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {30655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30655#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:39,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {30655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30656#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:39,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {30656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30656#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:39,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {30656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30657#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:39,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {30657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30657#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:39,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {30657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30658#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:39,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {30658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30658#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:39,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {30658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30659#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:39,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {30659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30659#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:39,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {30659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30660#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:39,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {30660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30660#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:39,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {30660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30661#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:39,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {30661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30661#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:39,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {30661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30662#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:39,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {30662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30662#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:39,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {30662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30663#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:39,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {30663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30663#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:39,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {30663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30664#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:39,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {30664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30664#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:39,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {30664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30665#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:39,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {30665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30665#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:39,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {30665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30666#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:39,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {30666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30666#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:39,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {30666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30667#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:39,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {30667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30667#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:39,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {30667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30668#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:39,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {30668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30668#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:39,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {30668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30669#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:39,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {30669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30669#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:39,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {30669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30670#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:39,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {30670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30670#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:39,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {30670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30671#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:39,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {30671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30671#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:39,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {30671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30672#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:39,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {30672#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30672#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:39,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {30672#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30673#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:39,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {30673#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30673#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:39,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {30673#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30674#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:39,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {30674#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30674#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:39,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {30674#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30675#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:39,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {30675#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30675#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:39,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {30675#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30676#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:39,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {30676#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30676#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:39,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {30676#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30677#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:39,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {30677#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30677#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:39,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {30677#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30678#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:39,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {30678#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30678#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:39,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {30678#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30679#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:39,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {30679#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30679#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:39,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {30679#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30680#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:39,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {30680#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30680#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:39,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {30680#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30681#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:39,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {30681#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30681#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:39,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {30681#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30682#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:39,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {30682#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30682#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:39,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {30682#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30683#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:39,254 INFO L290 TraceCheckUtils]: 64: Hoare triple {30683#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30683#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:39,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {30683#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30684#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:39,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {30684#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30684#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:39,255 INFO L290 TraceCheckUtils]: 67: Hoare triple {30684#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30685#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:39,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {30685#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30685#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:39,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {30685#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30686#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:39,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {30686#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30686#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:39,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {30686#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30687#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:39,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {30687#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30687#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:39,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {30687#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30688#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:39,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {30688#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30688#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:39,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {30688#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30689#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:39,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {30689#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30689#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:39,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {30689#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30690#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:39,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {30690#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30690#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:39,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {30690#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30691#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:39,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {30691#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30691#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:39,260 INFO L290 TraceCheckUtils]: 81: Hoare triple {30691#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30692#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:39,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {30692#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30692#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:39,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {30692#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30693#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:39,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {30693#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30693#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:39,261 INFO L290 TraceCheckUtils]: 85: Hoare triple {30693#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30694#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:39,261 INFO L290 TraceCheckUtils]: 86: Hoare triple {30694#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30694#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:39,261 INFO L290 TraceCheckUtils]: 87: Hoare triple {30694#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30695#(<= main_~i~0 41)} is VALID [2022-04-15 05:48:39,262 INFO L290 TraceCheckUtils]: 88: Hoare triple {30695#(<= main_~i~0 41)} assume !(~i~0 < 1024); {30650#false} is VALID [2022-04-15 05:48:39,262 INFO L290 TraceCheckUtils]: 89: Hoare triple {30650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {30650#false} is VALID [2022-04-15 05:48:39,262 INFO L272 TraceCheckUtils]: 90: Hoare triple {30650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {30650#false} is VALID [2022-04-15 05:48:39,262 INFO L290 TraceCheckUtils]: 91: Hoare triple {30650#false} ~cond := #in~cond; {30650#false} is VALID [2022-04-15 05:48:39,262 INFO L290 TraceCheckUtils]: 92: Hoare triple {30650#false} assume 0 == ~cond; {30650#false} is VALID [2022-04-15 05:48:39,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {30650#false} assume !false; {30650#false} is VALID [2022-04-15 05:48:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:48:39,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524897509] [2022-04-15 05:48:39,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524897509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:48:39,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636363102] [2022-04-15 05:48:39,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:48:39,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:39,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:48:39,264 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:48:39,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 05:48:39,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:48:39,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:48:39,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 05:48:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:39,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:48:40,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {30649#true} call ULTIMATE.init(); {30649#true} is VALID [2022-04-15 05:48:40,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {30649#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(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-15 05:48:40,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-15 05:48:40,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-15 05:48:40,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {30649#true} call #t~ret6 := main(); {30649#true} is VALID [2022-04-15 05:48:40,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {30649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {30715#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:40,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {30715#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30715#(<= main_~i~0 0)} is VALID [2022-04-15 05:48:40,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {30715#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30655#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:40,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {30655#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30655#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:40,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {30655#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30656#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:40,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {30656#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30656#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:40,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {30656#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30657#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:40,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {30657#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30657#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:40,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {30657#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30658#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:40,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {30658#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30658#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:40,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {30658#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30659#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:40,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {30659#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30659#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:40,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {30659#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30660#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:40,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {30660#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30660#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:40,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {30660#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30661#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:40,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {30661#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30661#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:40,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {30661#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30662#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:40,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {30662#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30662#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:40,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {30662#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30663#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:40,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {30663#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30663#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:40,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {30663#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30664#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:40,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {30664#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30664#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:40,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {30664#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30665#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:40,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {30665#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30665#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:40,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {30665#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30666#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:40,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {30666#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30666#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:40,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {30666#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30667#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:40,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {30667#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30667#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:40,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {30667#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30668#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:40,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {30668#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30668#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:40,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {30668#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30669#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:40,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {30669#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30669#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:40,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {30669#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30670#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:40,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {30670#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30670#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:40,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {30670#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30671#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:40,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {30671#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30671#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:40,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {30671#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30672#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:40,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {30672#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30672#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:40,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {30672#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30673#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:40,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {30673#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30673#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:40,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {30673#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30674#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:40,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {30674#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30674#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:40,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {30674#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30675#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:40,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {30675#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30675#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:40,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {30675#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30676#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:40,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {30676#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30676#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:40,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {30676#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30677#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:40,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {30677#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30677#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:40,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {30677#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30678#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:40,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {30678#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30678#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:40,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {30678#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30679#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:40,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {30679#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30679#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:40,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {30679#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30680#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:40,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {30680#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30680#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:40,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {30680#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30681#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:40,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {30681#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30681#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:40,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {30681#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30682#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:40,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {30682#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30682#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:40,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {30682#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30683#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:40,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {30683#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30683#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:40,038 INFO L290 TraceCheckUtils]: 65: Hoare triple {30683#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30684#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:40,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {30684#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30684#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:40,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {30684#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30685#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:40,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {30685#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30685#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:40,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {30685#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30686#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:40,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {30686#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30686#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:40,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {30686#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30687#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:40,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {30687#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30687#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:40,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {30687#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30688#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:40,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {30688#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30688#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:40,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {30688#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30689#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:40,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {30689#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30689#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:40,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {30689#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30690#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:40,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {30690#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30690#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:40,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {30690#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30691#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:40,042 INFO L290 TraceCheckUtils]: 80: Hoare triple {30691#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30691#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:40,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {30691#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30692#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:40,043 INFO L290 TraceCheckUtils]: 82: Hoare triple {30692#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30692#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:40,043 INFO L290 TraceCheckUtils]: 83: Hoare triple {30692#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30693#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:40,044 INFO L290 TraceCheckUtils]: 84: Hoare triple {30693#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30693#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:40,044 INFO L290 TraceCheckUtils]: 85: Hoare triple {30693#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30694#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:40,044 INFO L290 TraceCheckUtils]: 86: Hoare triple {30694#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30694#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:40,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {30694#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30695#(<= main_~i~0 41)} is VALID [2022-04-15 05:48:40,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {30695#(<= main_~i~0 41)} assume !(~i~0 < 1024); {30650#false} is VALID [2022-04-15 05:48:40,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {30650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {30650#false} is VALID [2022-04-15 05:48:40,045 INFO L272 TraceCheckUtils]: 90: Hoare triple {30650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {30650#false} is VALID [2022-04-15 05:48:40,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {30650#false} ~cond := #in~cond; {30650#false} is VALID [2022-04-15 05:48:40,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {30650#false} assume 0 == ~cond; {30650#false} is VALID [2022-04-15 05:48:40,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {30650#false} assume !false; {30650#false} is VALID [2022-04-15 05:48:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:40,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:48:42,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {30650#false} assume !false; {30650#false} is VALID [2022-04-15 05:48:42,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {30650#false} assume 0 == ~cond; {30650#false} is VALID [2022-04-15 05:48:42,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {30650#false} ~cond := #in~cond; {30650#false} is VALID [2022-04-15 05:48:42,189 INFO L272 TraceCheckUtils]: 90: Hoare triple {30650#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {30650#false} is VALID [2022-04-15 05:48:42,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {30650#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {30650#false} is VALID [2022-04-15 05:48:42,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {30995#(< main_~i~0 1024)} assume !(~i~0 < 1024); {30650#false} is VALID [2022-04-15 05:48:42,198 INFO L290 TraceCheckUtils]: 87: Hoare triple {30999#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30995#(< main_~i~0 1024)} is VALID [2022-04-15 05:48:42,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {30999#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {30999#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:42,199 INFO L290 TraceCheckUtils]: 85: Hoare triple {31006#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {30999#(< main_~i~0 1023)} is VALID [2022-04-15 05:48:42,199 INFO L290 TraceCheckUtils]: 84: Hoare triple {31006#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31006#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:42,199 INFO L290 TraceCheckUtils]: 83: Hoare triple {31013#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31006#(< main_~i~0 1022)} is VALID [2022-04-15 05:48:42,199 INFO L290 TraceCheckUtils]: 82: Hoare triple {31013#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31013#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:42,200 INFO L290 TraceCheckUtils]: 81: Hoare triple {31020#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31013#(< main_~i~0 1021)} is VALID [2022-04-15 05:48:42,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {31020#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31020#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:42,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {31027#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31020#(< main_~i~0 1020)} is VALID [2022-04-15 05:48:42,201 INFO L290 TraceCheckUtils]: 78: Hoare triple {31027#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31027#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:42,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {31034#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31027#(< main_~i~0 1019)} is VALID [2022-04-15 05:48:42,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {31034#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31034#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:42,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {31041#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31034#(< main_~i~0 1018)} is VALID [2022-04-15 05:48:42,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {31041#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31041#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:42,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {31048#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31041#(< main_~i~0 1017)} is VALID [2022-04-15 05:48:42,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {31048#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31048#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:42,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {31055#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31048#(< main_~i~0 1016)} is VALID [2022-04-15 05:48:42,203 INFO L290 TraceCheckUtils]: 70: Hoare triple {31055#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31055#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:42,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {31062#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31055#(< main_~i~0 1015)} is VALID [2022-04-15 05:48:42,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {31062#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31062#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:42,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {31069#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31062#(< main_~i~0 1014)} is VALID [2022-04-15 05:48:42,204 INFO L290 TraceCheckUtils]: 66: Hoare triple {31069#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31069#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:42,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {31076#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31069#(< main_~i~0 1013)} is VALID [2022-04-15 05:48:42,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {31076#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31076#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:42,205 INFO L290 TraceCheckUtils]: 63: Hoare triple {31083#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31076#(< main_~i~0 1012)} is VALID [2022-04-15 05:48:42,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {31083#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31083#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:42,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {31090#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31083#(< main_~i~0 1011)} is VALID [2022-04-15 05:48:42,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {31090#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31090#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:42,207 INFO L290 TraceCheckUtils]: 59: Hoare triple {31097#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31090#(< main_~i~0 1010)} is VALID [2022-04-15 05:48:42,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {31097#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31097#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:42,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {31104#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31097#(< main_~i~0 1009)} is VALID [2022-04-15 05:48:42,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {31104#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31104#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:42,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {31111#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31104#(< main_~i~0 1008)} is VALID [2022-04-15 05:48:42,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {31111#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31111#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:42,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {31118#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31111#(< main_~i~0 1007)} is VALID [2022-04-15 05:48:42,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {31118#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31118#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:42,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {31125#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31118#(< main_~i~0 1006)} is VALID [2022-04-15 05:48:42,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {31125#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31125#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:42,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {31132#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31125#(< main_~i~0 1005)} is VALID [2022-04-15 05:48:42,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {31132#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31132#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:42,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {31139#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31132#(< main_~i~0 1004)} is VALID [2022-04-15 05:48:42,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {31139#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31139#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:42,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {31146#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31139#(< main_~i~0 1003)} is VALID [2022-04-15 05:48:42,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {31146#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31146#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:42,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {31153#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31146#(< main_~i~0 1002)} is VALID [2022-04-15 05:48:42,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {31153#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31153#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:42,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {31160#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31153#(< main_~i~0 1001)} is VALID [2022-04-15 05:48:42,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {31160#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31160#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:42,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {31167#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31160#(< main_~i~0 1000)} is VALID [2022-04-15 05:48:42,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {31167#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31167#(< main_~i~0 999)} is VALID [2022-04-15 05:48:42,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {31174#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31167#(< main_~i~0 999)} is VALID [2022-04-15 05:48:42,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {31174#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31174#(< main_~i~0 998)} is VALID [2022-04-15 05:48:42,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {31181#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31174#(< main_~i~0 998)} is VALID [2022-04-15 05:48:42,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {31181#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31181#(< main_~i~0 997)} is VALID [2022-04-15 05:48:42,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {31188#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31181#(< main_~i~0 997)} is VALID [2022-04-15 05:48:42,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {31188#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31188#(< main_~i~0 996)} is VALID [2022-04-15 05:48:42,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {31195#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31188#(< main_~i~0 996)} is VALID [2022-04-15 05:48:42,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {31195#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31195#(< main_~i~0 995)} is VALID [2022-04-15 05:48:42,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {31202#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31195#(< main_~i~0 995)} is VALID [2022-04-15 05:48:42,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {31202#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31202#(< main_~i~0 994)} is VALID [2022-04-15 05:48:42,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {31209#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31202#(< main_~i~0 994)} is VALID [2022-04-15 05:48:42,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {31209#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31209#(< main_~i~0 993)} is VALID [2022-04-15 05:48:42,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {31216#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31209#(< main_~i~0 993)} is VALID [2022-04-15 05:48:42,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {31216#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31216#(< main_~i~0 992)} is VALID [2022-04-15 05:48:42,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {31223#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31216#(< main_~i~0 992)} is VALID [2022-04-15 05:48:42,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {31223#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31223#(< main_~i~0 991)} is VALID [2022-04-15 05:48:42,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {31230#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31223#(< main_~i~0 991)} is VALID [2022-04-15 05:48:42,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {31230#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31230#(< main_~i~0 990)} is VALID [2022-04-15 05:48:42,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {31237#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31230#(< main_~i~0 990)} is VALID [2022-04-15 05:48:42,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {31237#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31237#(< main_~i~0 989)} is VALID [2022-04-15 05:48:42,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {31244#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31237#(< main_~i~0 989)} is VALID [2022-04-15 05:48:42,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {31244#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31244#(< main_~i~0 988)} is VALID [2022-04-15 05:48:42,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {31251#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31244#(< main_~i~0 988)} is VALID [2022-04-15 05:48:42,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {31251#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31251#(< main_~i~0 987)} is VALID [2022-04-15 05:48:42,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {31258#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31251#(< main_~i~0 987)} is VALID [2022-04-15 05:48:42,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {31258#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31258#(< main_~i~0 986)} is VALID [2022-04-15 05:48:42,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {31265#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31258#(< main_~i~0 986)} is VALID [2022-04-15 05:48:42,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {31265#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31265#(< main_~i~0 985)} is VALID [2022-04-15 05:48:42,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {31272#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31265#(< main_~i~0 985)} is VALID [2022-04-15 05:48:42,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {31272#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31272#(< main_~i~0 984)} is VALID [2022-04-15 05:48:42,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {31279#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31272#(< main_~i~0 984)} is VALID [2022-04-15 05:48:42,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {31279#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31279#(< main_~i~0 983)} is VALID [2022-04-15 05:48:42,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {30649#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {31279#(< main_~i~0 983)} is VALID [2022-04-15 05:48:42,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {30649#true} call #t~ret6 := main(); {30649#true} is VALID [2022-04-15 05:48:42,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30649#true} {30649#true} #39#return; {30649#true} is VALID [2022-04-15 05:48:42,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {30649#true} assume true; {30649#true} is VALID [2022-04-15 05:48:42,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {30649#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(12, 2);call #Ultimate.allocInit(12, 3); {30649#true} is VALID [2022-04-15 05:48:42,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {30649#true} call ULTIMATE.init(); {30649#true} is VALID [2022-04-15 05:48:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:42,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636363102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:48:42,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:48:42,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-15 05:48:42,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:48:42,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498806291] [2022-04-15 05:48:42,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498806291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:48:42,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:48:42,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 05:48:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144849429] [2022-04-15 05:48:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:48:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 05:48:42,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:48:42,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:42,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:42,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 05:48:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:42,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 05:48:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 05:48:42,285 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:43,656 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-15 05:48:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 05:48:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 05:48:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:48:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-15 05:48:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-15 05:48:43,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 104 transitions. [2022-04-15 05:48:43,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:48:43,735 INFO L225 Difference]: With dead ends: 104 [2022-04-15 05:48:43,735 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 05:48:43,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7398, Invalid=9372, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 05:48:43,736 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 92 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:48:43,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 24 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:48:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 05:48:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-15 05:48:44,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:48:44,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:44,129 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:44,129 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:44,131 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-15 05:48:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-15 05:48:44,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:44,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:44,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-15 05:48:44,131 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-15 05:48:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:48:44,132 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-15 05:48:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-15 05:48:44,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:48:44,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:48:44,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:48:44,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:48:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2022-04-15 05:48:44,134 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2022-04-15 05:48:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:48:44,134 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2022-04-15 05:48:44,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:48:44,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 97 transitions. [2022-04-15 05:48:44,250 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-15 05:48:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2022-04-15 05:48:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 05:48:44,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:48:44,251 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:48:44,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-15 05:48:44,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:44,455 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:48:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:48:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1514079410, now seen corresponding path program 83 times [2022-04-15 05:48:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:48:44,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142132055] [2022-04-15 05:48:44,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:48:44,458 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:48:44,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:48:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1514079410, now seen corresponding path program 84 times [2022-04-15 05:48:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:48:44,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123247142] [2022-04-15 05:48:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:48:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:48:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:48:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:48:45,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {32033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-15 05:48:45,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-15 05:48:45,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-15 05:48:45,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {31985#true} call ULTIMATE.init(); {32033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:48:45,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {32033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-15 05:48:45,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-15 05:48:45,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-15 05:48:45,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {31985#true} call #t~ret6 := main(); {31985#true} is VALID [2022-04-15 05:48:45,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {31985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {31990#(= main_~i~0 0)} is VALID [2022-04-15 05:48:45,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {31990#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31990#(= main_~i~0 0)} is VALID [2022-04-15 05:48:45,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {31990#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31991#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:45,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {31991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31991#(<= main_~i~0 1)} is VALID [2022-04-15 05:48:45,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {31991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31992#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:45,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {31992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31992#(<= main_~i~0 2)} is VALID [2022-04-15 05:48:45,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {31992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31993#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:45,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {31993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31993#(<= main_~i~0 3)} is VALID [2022-04-15 05:48:45,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {31993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31994#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:45,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {31994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31994#(<= main_~i~0 4)} is VALID [2022-04-15 05:48:45,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {31994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31995#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:45,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {31995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31995#(<= main_~i~0 5)} is VALID [2022-04-15 05:48:45,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {31995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31996#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:45,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {31996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31996#(<= main_~i~0 6)} is VALID [2022-04-15 05:48:45,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {31996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31997#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:45,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {31997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31997#(<= main_~i~0 7)} is VALID [2022-04-15 05:48:45,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {31997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31998#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:45,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {31998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31998#(<= main_~i~0 8)} is VALID [2022-04-15 05:48:45,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {31998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31999#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:45,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {31999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31999#(<= main_~i~0 9)} is VALID [2022-04-15 05:48:45,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {31999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32000#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:45,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {32000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32000#(<= main_~i~0 10)} is VALID [2022-04-15 05:48:45,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {32000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32001#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:45,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {32001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32001#(<= main_~i~0 11)} is VALID [2022-04-15 05:48:45,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {32001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32002#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:45,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {32002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32002#(<= main_~i~0 12)} is VALID [2022-04-15 05:48:45,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {32002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32003#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:45,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {32003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32003#(<= main_~i~0 13)} is VALID [2022-04-15 05:48:45,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {32003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32004#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:45,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {32004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32004#(<= main_~i~0 14)} is VALID [2022-04-15 05:48:45,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {32004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32005#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:45,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {32005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32005#(<= main_~i~0 15)} is VALID [2022-04-15 05:48:45,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {32005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32006#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:45,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {32006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32006#(<= main_~i~0 16)} is VALID [2022-04-15 05:48:45,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {32006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32007#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:45,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {32007#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32007#(<= main_~i~0 17)} is VALID [2022-04-15 05:48:45,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {32007#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32008#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:45,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {32008#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32008#(<= main_~i~0 18)} is VALID [2022-04-15 05:48:45,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {32008#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32009#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:45,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {32009#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32009#(<= main_~i~0 19)} is VALID [2022-04-15 05:48:45,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {32009#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32010#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:45,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {32010#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32010#(<= main_~i~0 20)} is VALID [2022-04-15 05:48:45,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {32010#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32011#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:45,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {32011#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32011#(<= main_~i~0 21)} is VALID [2022-04-15 05:48:45,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {32011#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32012#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:45,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {32012#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32012#(<= main_~i~0 22)} is VALID [2022-04-15 05:48:45,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {32012#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32013#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:45,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {32013#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32013#(<= main_~i~0 23)} is VALID [2022-04-15 05:48:45,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {32013#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32014#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:45,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {32014#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32014#(<= main_~i~0 24)} is VALID [2022-04-15 05:48:45,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {32014#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32015#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:45,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {32015#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32015#(<= main_~i~0 25)} is VALID [2022-04-15 05:48:45,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {32015#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32016#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:45,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {32016#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32016#(<= main_~i~0 26)} is VALID [2022-04-15 05:48:45,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {32016#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32017#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:45,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {32017#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32017#(<= main_~i~0 27)} is VALID [2022-04-15 05:48:45,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {32017#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32018#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:45,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {32018#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32018#(<= main_~i~0 28)} is VALID [2022-04-15 05:48:45,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {32018#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32019#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:45,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {32019#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32019#(<= main_~i~0 29)} is VALID [2022-04-15 05:48:45,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {32019#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32020#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:45,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {32020#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32020#(<= main_~i~0 30)} is VALID [2022-04-15 05:48:45,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {32020#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32021#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:45,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {32021#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32021#(<= main_~i~0 31)} is VALID [2022-04-15 05:48:45,233 INFO L290 TraceCheckUtils]: 69: Hoare triple {32021#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32022#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:45,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {32022#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32022#(<= main_~i~0 32)} is VALID [2022-04-15 05:48:45,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {32022#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32023#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:45,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {32023#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32023#(<= main_~i~0 33)} is VALID [2022-04-15 05:48:45,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {32023#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32024#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:45,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {32024#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32024#(<= main_~i~0 34)} is VALID [2022-04-15 05:48:45,235 INFO L290 TraceCheckUtils]: 75: Hoare triple {32024#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32025#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:45,235 INFO L290 TraceCheckUtils]: 76: Hoare triple {32025#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32025#(<= main_~i~0 35)} is VALID [2022-04-15 05:48:45,235 INFO L290 TraceCheckUtils]: 77: Hoare triple {32025#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32026#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:45,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {32026#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32026#(<= main_~i~0 36)} is VALID [2022-04-15 05:48:45,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {32026#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32027#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:45,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {32027#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32027#(<= main_~i~0 37)} is VALID [2022-04-15 05:48:45,237 INFO L290 TraceCheckUtils]: 81: Hoare triple {32027#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32028#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:45,237 INFO L290 TraceCheckUtils]: 82: Hoare triple {32028#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32028#(<= main_~i~0 38)} is VALID [2022-04-15 05:48:45,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {32028#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32029#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:45,238 INFO L290 TraceCheckUtils]: 84: Hoare triple {32029#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32029#(<= main_~i~0 39)} is VALID [2022-04-15 05:48:45,238 INFO L290 TraceCheckUtils]: 85: Hoare triple {32029#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32030#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:45,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {32030#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32030#(<= main_~i~0 40)} is VALID [2022-04-15 05:48:45,238 INFO L290 TraceCheckUtils]: 87: Hoare triple {32030#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32031#(<= main_~i~0 41)} is VALID [2022-04-15 05:48:45,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {32031#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32031#(<= main_~i~0 41)} is VALID [2022-04-15 05:48:45,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {32031#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32032#(<= main_~i~0 42)} is VALID [2022-04-15 05:48:45,239 INFO L290 TraceCheckUtils]: 90: Hoare triple {32032#(<= main_~i~0 42)} assume !(~i~0 < 1024); {31986#false} is VALID [2022-04-15 05:48:45,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {31986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {31986#false} is VALID [2022-04-15 05:48:45,240 INFO L272 TraceCheckUtils]: 92: Hoare triple {31986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {31986#false} is VALID [2022-04-15 05:48:45,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {31986#false} ~cond := #in~cond; {31986#false} is VALID [2022-04-15 05:48:45,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {31986#false} assume 0 == ~cond; {31986#false} is VALID [2022-04-15 05:48:45,240 INFO L290 TraceCheckUtils]: 95: Hoare triple {31986#false} assume !false; {31986#false} is VALID [2022-04-15 05:48:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:48:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:48:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123247142] [2022-04-15 05:48:45,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123247142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:48:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51212019] [2022-04-15 05:48:45,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:48:45,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:48:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:48:45,241 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:48:45,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 05:49:34,365 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-15 05:49:34,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:49:34,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 05:49:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:34,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:49:34,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {31985#true} call ULTIMATE.init(); {31985#true} is VALID [2022-04-15 05:49:34,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {31985#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(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-15 05:49:34,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-15 05:49:34,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-15 05:49:34,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {31985#true} call #t~ret6 := main(); {31985#true} is VALID [2022-04-15 05:49:34,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {31985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {32052#(<= main_~i~0 0)} is VALID [2022-04-15 05:49:34,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {32052#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32052#(<= main_~i~0 0)} is VALID [2022-04-15 05:49:34,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {32052#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31991#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:34,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {31991#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31991#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:34,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {31991#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31992#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:34,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {31992#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31992#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:34,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {31992#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31993#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:34,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {31993#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31993#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:34,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {31993#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31994#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:34,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {31994#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31994#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:34,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {31994#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31995#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:34,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {31995#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31995#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:34,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {31995#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31996#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:34,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {31996#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31996#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:34,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {31996#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31997#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:34,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {31997#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31997#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:34,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {31997#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31998#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:34,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {31998#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31998#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:34,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {31998#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31999#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:34,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {31999#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31999#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:34,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {31999#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32000#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:34,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {32000#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32000#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:34,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {32000#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32001#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:34,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {32001#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32001#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:34,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {32001#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32002#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:34,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {32002#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32002#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:34,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {32002#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32003#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:34,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {32003#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32003#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:34,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {32003#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32004#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:34,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {32004#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32004#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:34,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {32004#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32005#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:34,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {32005#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32005#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:34,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {32005#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32006#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:34,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {32006#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32006#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:34,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {32006#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32007#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:34,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {32007#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32007#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:34,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {32007#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32008#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:34,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {32008#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32008#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:34,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {32008#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32009#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:34,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {32009#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32009#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:34,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {32009#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32010#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:34,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {32010#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32010#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:34,998 INFO L290 TraceCheckUtils]: 47: Hoare triple {32010#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32011#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:34,998 INFO L290 TraceCheckUtils]: 48: Hoare triple {32011#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32011#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:34,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {32011#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32012#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:34,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {32012#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32012#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:34,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {32012#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32013#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:35,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {32013#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32013#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:35,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {32013#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32014#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:35,000 INFO L290 TraceCheckUtils]: 54: Hoare triple {32014#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32014#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:35,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {32014#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32015#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:35,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {32015#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32015#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:35,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {32015#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32016#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:35,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {32016#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32016#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:35,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {32016#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32017#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:35,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {32017#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32017#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:35,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {32017#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32018#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:35,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {32018#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32018#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:35,004 INFO L290 TraceCheckUtils]: 63: Hoare triple {32018#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32019#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:35,004 INFO L290 TraceCheckUtils]: 64: Hoare triple {32019#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32019#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:35,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {32019#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32020#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:35,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {32020#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32020#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:35,005 INFO L290 TraceCheckUtils]: 67: Hoare triple {32020#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32021#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:35,005 INFO L290 TraceCheckUtils]: 68: Hoare triple {32021#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32021#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:35,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {32021#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32022#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:35,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {32022#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32022#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:35,006 INFO L290 TraceCheckUtils]: 71: Hoare triple {32022#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32023#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:35,007 INFO L290 TraceCheckUtils]: 72: Hoare triple {32023#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32023#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:35,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {32023#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32024#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:35,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {32024#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32024#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:35,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {32024#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32025#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:35,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {32025#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32025#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:35,008 INFO L290 TraceCheckUtils]: 77: Hoare triple {32025#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32026#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:35,008 INFO L290 TraceCheckUtils]: 78: Hoare triple {32026#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32026#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:35,009 INFO L290 TraceCheckUtils]: 79: Hoare triple {32026#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32027#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:35,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {32027#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32027#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:35,009 INFO L290 TraceCheckUtils]: 81: Hoare triple {32027#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32028#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:35,010 INFO L290 TraceCheckUtils]: 82: Hoare triple {32028#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32028#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:35,010 INFO L290 TraceCheckUtils]: 83: Hoare triple {32028#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32029#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:35,010 INFO L290 TraceCheckUtils]: 84: Hoare triple {32029#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32029#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:35,011 INFO L290 TraceCheckUtils]: 85: Hoare triple {32029#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32030#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:35,011 INFO L290 TraceCheckUtils]: 86: Hoare triple {32030#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32030#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:35,011 INFO L290 TraceCheckUtils]: 87: Hoare triple {32030#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32031#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 88: Hoare triple {32031#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32031#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {32031#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32032#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 90: Hoare triple {32032#(<= main_~i~0 42)} assume !(~i~0 < 1024); {31986#false} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 91: Hoare triple {31986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {31986#false} is VALID [2022-04-15 05:49:35,012 INFO L272 TraceCheckUtils]: 92: Hoare triple {31986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {31986#false} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 93: Hoare triple {31986#false} ~cond := #in~cond; {31986#false} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {31986#false} assume 0 == ~cond; {31986#false} is VALID [2022-04-15 05:49:35,012 INFO L290 TraceCheckUtils]: 95: Hoare triple {31986#false} assume !false; {31986#false} is VALID [2022-04-15 05:49:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:35,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:49:37,332 INFO L290 TraceCheckUtils]: 95: Hoare triple {31986#false} assume !false; {31986#false} is VALID [2022-04-15 05:49:37,332 INFO L290 TraceCheckUtils]: 94: Hoare triple {31986#false} assume 0 == ~cond; {31986#false} is VALID [2022-04-15 05:49:37,332 INFO L290 TraceCheckUtils]: 93: Hoare triple {31986#false} ~cond := #in~cond; {31986#false} is VALID [2022-04-15 05:49:37,332 INFO L272 TraceCheckUtils]: 92: Hoare triple {31986#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {31986#false} is VALID [2022-04-15 05:49:37,332 INFO L290 TraceCheckUtils]: 91: Hoare triple {31986#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {31986#false} is VALID [2022-04-15 05:49:37,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {32338#(< main_~i~0 1024)} assume !(~i~0 < 1024); {31986#false} is VALID [2022-04-15 05:49:37,333 INFO L290 TraceCheckUtils]: 89: Hoare triple {32342#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32338#(< main_~i~0 1024)} is VALID [2022-04-15 05:49:37,333 INFO L290 TraceCheckUtils]: 88: Hoare triple {32342#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32342#(< main_~i~0 1023)} is VALID [2022-04-15 05:49:37,333 INFO L290 TraceCheckUtils]: 87: Hoare triple {32349#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32342#(< main_~i~0 1023)} is VALID [2022-04-15 05:49:37,334 INFO L290 TraceCheckUtils]: 86: Hoare triple {32349#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32349#(< main_~i~0 1022)} is VALID [2022-04-15 05:49:37,334 INFO L290 TraceCheckUtils]: 85: Hoare triple {32356#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32349#(< main_~i~0 1022)} is VALID [2022-04-15 05:49:37,334 INFO L290 TraceCheckUtils]: 84: Hoare triple {32356#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32356#(< main_~i~0 1021)} is VALID [2022-04-15 05:49:37,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {32363#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32356#(< main_~i~0 1021)} is VALID [2022-04-15 05:49:37,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {32363#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32363#(< main_~i~0 1020)} is VALID [2022-04-15 05:49:37,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {32370#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32363#(< main_~i~0 1020)} is VALID [2022-04-15 05:49:37,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {32370#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32370#(< main_~i~0 1019)} is VALID [2022-04-15 05:49:37,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {32377#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32370#(< main_~i~0 1019)} is VALID [2022-04-15 05:49:37,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {32377#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32377#(< main_~i~0 1018)} is VALID [2022-04-15 05:49:37,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {32384#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32377#(< main_~i~0 1018)} is VALID [2022-04-15 05:49:37,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {32384#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32384#(< main_~i~0 1017)} is VALID [2022-04-15 05:49:37,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {32391#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32384#(< main_~i~0 1017)} is VALID [2022-04-15 05:49:37,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {32391#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32391#(< main_~i~0 1016)} is VALID [2022-04-15 05:49:37,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {32398#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32391#(< main_~i~0 1016)} is VALID [2022-04-15 05:49:37,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {32398#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32398#(< main_~i~0 1015)} is VALID [2022-04-15 05:49:37,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {32405#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32398#(< main_~i~0 1015)} is VALID [2022-04-15 05:49:37,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {32405#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32405#(< main_~i~0 1014)} is VALID [2022-04-15 05:49:37,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {32412#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32405#(< main_~i~0 1014)} is VALID [2022-04-15 05:49:37,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {32412#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32412#(< main_~i~0 1013)} is VALID [2022-04-15 05:49:37,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {32419#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32412#(< main_~i~0 1013)} is VALID [2022-04-15 05:49:37,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {32419#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32419#(< main_~i~0 1012)} is VALID [2022-04-15 05:49:37,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {32426#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32419#(< main_~i~0 1012)} is VALID [2022-04-15 05:49:37,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {32426#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32426#(< main_~i~0 1011)} is VALID [2022-04-15 05:49:37,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {32433#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32426#(< main_~i~0 1011)} is VALID [2022-04-15 05:49:37,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {32433#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32433#(< main_~i~0 1010)} is VALID [2022-04-15 05:49:37,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {32440#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32433#(< main_~i~0 1010)} is VALID [2022-04-15 05:49:37,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {32440#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32440#(< main_~i~0 1009)} is VALID [2022-04-15 05:49:37,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {32447#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32440#(< main_~i~0 1009)} is VALID [2022-04-15 05:49:37,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {32447#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32447#(< main_~i~0 1008)} is VALID [2022-04-15 05:49:37,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {32454#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32447#(< main_~i~0 1008)} is VALID [2022-04-15 05:49:37,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {32454#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32454#(< main_~i~0 1007)} is VALID [2022-04-15 05:49:37,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {32461#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32454#(< main_~i~0 1007)} is VALID [2022-04-15 05:49:37,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {32461#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32461#(< main_~i~0 1006)} is VALID [2022-04-15 05:49:37,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {32468#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32461#(< main_~i~0 1006)} is VALID [2022-04-15 05:49:37,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {32468#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32468#(< main_~i~0 1005)} is VALID [2022-04-15 05:49:37,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {32475#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32468#(< main_~i~0 1005)} is VALID [2022-04-15 05:49:37,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {32475#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32475#(< main_~i~0 1004)} is VALID [2022-04-15 05:49:37,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {32482#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32475#(< main_~i~0 1004)} is VALID [2022-04-15 05:49:37,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {32482#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32482#(< main_~i~0 1003)} is VALID [2022-04-15 05:49:37,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {32489#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32482#(< main_~i~0 1003)} is VALID [2022-04-15 05:49:37,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {32489#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32489#(< main_~i~0 1002)} is VALID [2022-04-15 05:49:37,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {32496#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32489#(< main_~i~0 1002)} is VALID [2022-04-15 05:49:37,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {32496#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32496#(< main_~i~0 1001)} is VALID [2022-04-15 05:49:37,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {32503#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32496#(< main_~i~0 1001)} is VALID [2022-04-15 05:49:37,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {32503#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32503#(< main_~i~0 1000)} is VALID [2022-04-15 05:49:37,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {32510#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32503#(< main_~i~0 1000)} is VALID [2022-04-15 05:49:37,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {32510#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32510#(< main_~i~0 999)} is VALID [2022-04-15 05:49:37,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {32517#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32510#(< main_~i~0 999)} is VALID [2022-04-15 05:49:37,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {32517#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32517#(< main_~i~0 998)} is VALID [2022-04-15 05:49:37,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {32524#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32517#(< main_~i~0 998)} is VALID [2022-04-15 05:49:37,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {32524#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32524#(< main_~i~0 997)} is VALID [2022-04-15 05:49:37,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {32531#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32524#(< main_~i~0 997)} is VALID [2022-04-15 05:49:37,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {32531#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32531#(< main_~i~0 996)} is VALID [2022-04-15 05:49:37,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {32538#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32531#(< main_~i~0 996)} is VALID [2022-04-15 05:49:37,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {32538#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32538#(< main_~i~0 995)} is VALID [2022-04-15 05:49:37,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {32545#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32538#(< main_~i~0 995)} is VALID [2022-04-15 05:49:37,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {32545#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32545#(< main_~i~0 994)} is VALID [2022-04-15 05:49:37,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {32552#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32545#(< main_~i~0 994)} is VALID [2022-04-15 05:49:37,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {32552#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32552#(< main_~i~0 993)} is VALID [2022-04-15 05:49:37,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {32559#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32552#(< main_~i~0 993)} is VALID [2022-04-15 05:49:37,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {32559#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32559#(< main_~i~0 992)} is VALID [2022-04-15 05:49:37,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {32566#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32559#(< main_~i~0 992)} is VALID [2022-04-15 05:49:37,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {32566#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32566#(< main_~i~0 991)} is VALID [2022-04-15 05:49:37,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {32573#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32566#(< main_~i~0 991)} is VALID [2022-04-15 05:49:37,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {32573#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32573#(< main_~i~0 990)} is VALID [2022-04-15 05:49:37,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {32580#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32573#(< main_~i~0 990)} is VALID [2022-04-15 05:49:37,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {32580#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32580#(< main_~i~0 989)} is VALID [2022-04-15 05:49:37,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {32587#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32580#(< main_~i~0 989)} is VALID [2022-04-15 05:49:37,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {32587#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32587#(< main_~i~0 988)} is VALID [2022-04-15 05:49:37,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {32594#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32587#(< main_~i~0 988)} is VALID [2022-04-15 05:49:37,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {32594#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32594#(< main_~i~0 987)} is VALID [2022-04-15 05:49:37,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {32601#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32594#(< main_~i~0 987)} is VALID [2022-04-15 05:49:37,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {32601#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32601#(< main_~i~0 986)} is VALID [2022-04-15 05:49:37,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {32608#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32601#(< main_~i~0 986)} is VALID [2022-04-15 05:49:37,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {32608#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32608#(< main_~i~0 985)} is VALID [2022-04-15 05:49:37,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {32615#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32608#(< main_~i~0 985)} is VALID [2022-04-15 05:49:37,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {32615#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32615#(< main_~i~0 984)} is VALID [2022-04-15 05:49:37,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {32622#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32615#(< main_~i~0 984)} is VALID [2022-04-15 05:49:37,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {32622#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32622#(< main_~i~0 983)} is VALID [2022-04-15 05:49:37,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {32629#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32622#(< main_~i~0 983)} is VALID [2022-04-15 05:49:37,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {32629#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {32629#(< main_~i~0 982)} is VALID [2022-04-15 05:49:37,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {31985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {32629#(< main_~i~0 982)} is VALID [2022-04-15 05:49:37,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {31985#true} call #t~ret6 := main(); {31985#true} is VALID [2022-04-15 05:49:37,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31985#true} {31985#true} #39#return; {31985#true} is VALID [2022-04-15 05:49:37,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {31985#true} assume true; {31985#true} is VALID [2022-04-15 05:49:37,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {31985#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(12, 2);call #Ultimate.allocInit(12, 3); {31985#true} is VALID [2022-04-15 05:49:37,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {31985#true} call ULTIMATE.init(); {31985#true} is VALID [2022-04-15 05:49:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:37,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51212019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:49:37,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:49:37,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-15 05:49:37,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:49:37,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142132055] [2022-04-15 05:49:37,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142132055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:49:37,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:49:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 05:49:37,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163500995] [2022-04-15 05:49:37,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:49:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 05:49:37,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:49:37,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:37,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:37,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 05:49:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:49:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 05:49:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 05:49:37,444 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:38,933 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-15 05:49:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 05:49:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 05:49:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:49:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-15 05:49:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-15 05:49:38,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 106 transitions. [2022-04-15 05:49:39,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:39,012 INFO L225 Difference]: With dead ends: 106 [2022-04-15 05:49:39,012 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 05:49:39,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 05:49:39,014 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 94 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:49:39,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 44 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:49:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 05:49:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-15 05:49:39,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:49:39,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:39,444 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:39,445 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:39,446 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-15 05:49:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-15 05:49:39,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:49:39,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:49:39,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 05:49:39,447 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 05:49:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:39,448 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-15 05:49:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-15 05:49:39,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:49:39,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:49:39,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:49:39,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:49:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-04-15 05:49:39,450 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2022-04-15 05:49:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:49:39,450 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-04-15 05:49:39,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:39,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 99 transitions. [2022-04-15 05:49:39,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-15 05:49:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 05:49:39,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:49:39,561 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:49:39,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-15 05:49:39,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:49:39,787 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:49:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:49:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 89512784, now seen corresponding path program 85 times [2022-04-15 05:49:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:49:39,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703187254] [2022-04-15 05:49:39,791 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:49:39,791 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:49:39,791 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:49:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash 89512784, now seen corresponding path program 86 times [2022-04-15 05:49:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:49:39,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651140586] [2022-04-15 05:49:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:49:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:49:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:49:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:40,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {33398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-15 05:49:40,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-15 05:49:40,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-15 05:49:40,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:49:40,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {33398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-15 05:49:40,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-15 05:49:40,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-15 05:49:40,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret6 := main(); {33349#true} is VALID [2022-04-15 05:49:40,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {33349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {33354#(= main_~i~0 0)} is VALID [2022-04-15 05:49:40,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {33354#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33354#(= main_~i~0 0)} is VALID [2022-04-15 05:49:40,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {33354#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33355#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:40,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {33355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33355#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:40,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {33355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33356#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:40,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {33356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33356#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:40,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {33356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33357#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:40,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {33357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33357#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:40,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {33357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33358#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:40,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {33358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33358#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:40,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {33358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33359#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:40,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {33359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33359#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:40,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {33359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33360#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:40,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {33360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33360#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:40,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {33360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33361#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:40,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {33361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33361#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:40,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {33361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33362#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:40,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {33362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33362#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:40,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {33362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33363#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:40,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {33363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33363#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:40,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {33363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33364#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:40,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {33364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33364#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:40,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {33364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33365#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:40,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {33365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33365#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:40,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {33365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33366#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:40,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {33366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33366#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:40,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {33366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33367#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:40,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {33367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33367#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:40,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {33367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33368#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:40,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {33368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33368#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:40,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {33368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33369#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:40,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {33369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33369#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:40,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {33369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33370#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:40,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {33370#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33370#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:40,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {33370#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33371#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:40,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {33371#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33371#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:40,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {33371#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33372#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:40,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {33372#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33372#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:40,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {33372#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33373#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:40,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {33373#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33373#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:40,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {33373#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33374#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:40,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {33374#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33374#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:40,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {33374#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33375#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:40,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {33375#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33375#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:40,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {33375#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33376#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:40,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {33376#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33376#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:40,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {33376#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33377#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:40,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {33377#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33377#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:40,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {33377#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33378#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:40,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {33378#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33378#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:40,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {33378#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33379#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:40,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {33379#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33379#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:40,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {33379#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33380#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:40,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {33380#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33380#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:40,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {33380#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33381#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:40,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {33381#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33381#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:40,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {33381#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33382#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:40,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {33382#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33382#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:40,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {33382#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33383#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:40,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {33383#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33383#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:40,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {33383#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33384#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:40,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {33384#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33384#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:40,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {33384#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33385#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:40,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {33385#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33385#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:40,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {33385#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33386#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:40,648 INFO L290 TraceCheckUtils]: 70: Hoare triple {33386#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33386#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:40,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {33386#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33387#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:40,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {33387#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33387#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:40,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {33387#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33388#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:40,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {33388#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33388#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:40,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {33388#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33389#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:40,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {33389#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33389#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:40,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {33389#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33390#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:40,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {33390#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33390#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:40,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {33390#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33391#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:40,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {33391#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33391#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:40,652 INFO L290 TraceCheckUtils]: 81: Hoare triple {33391#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33392#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:40,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {33392#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33392#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:40,652 INFO L290 TraceCheckUtils]: 83: Hoare triple {33392#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33393#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:40,653 INFO L290 TraceCheckUtils]: 84: Hoare triple {33393#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33393#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:40,653 INFO L290 TraceCheckUtils]: 85: Hoare triple {33393#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33394#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:40,653 INFO L290 TraceCheckUtils]: 86: Hoare triple {33394#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33394#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:40,660 INFO L290 TraceCheckUtils]: 87: Hoare triple {33394#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33395#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:40,660 INFO L290 TraceCheckUtils]: 88: Hoare triple {33395#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33395#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:40,661 INFO L290 TraceCheckUtils]: 89: Hoare triple {33395#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33396#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:40,661 INFO L290 TraceCheckUtils]: 90: Hoare triple {33396#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33396#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:40,661 INFO L290 TraceCheckUtils]: 91: Hoare triple {33396#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33397#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:40,662 INFO L290 TraceCheckUtils]: 92: Hoare triple {33397#(<= main_~i~0 43)} assume !(~i~0 < 1024); {33350#false} is VALID [2022-04-15 05:49:40,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {33350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {33350#false} is VALID [2022-04-15 05:49:40,662 INFO L272 TraceCheckUtils]: 94: Hoare triple {33350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {33350#false} is VALID [2022-04-15 05:49:40,662 INFO L290 TraceCheckUtils]: 95: Hoare triple {33350#false} ~cond := #in~cond; {33350#false} is VALID [2022-04-15 05:49:40,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {33350#false} assume 0 == ~cond; {33350#false} is VALID [2022-04-15 05:49:40,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2022-04-15 05:49:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:40,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:49:40,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651140586] [2022-04-15 05:49:40,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651140586] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:49:40,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251301236] [2022-04-15 05:49:40,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:49:40,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:49:40,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:49:40,668 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:49:40,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 05:49:40,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:49:40,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:49:40,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 05:49:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:40,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:49:41,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33349#true} is VALID [2022-04-15 05:49:41,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {33349#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(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-15 05:49:41,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-15 05:49:41,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-15 05:49:41,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret6 := main(); {33349#true} is VALID [2022-04-15 05:49:41,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {33349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {33417#(<= main_~i~0 0)} is VALID [2022-04-15 05:49:41,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {33417#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33417#(<= main_~i~0 0)} is VALID [2022-04-15 05:49:41,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {33417#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33355#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:41,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {33355#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33355#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:41,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {33355#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33356#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:41,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {33356#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33356#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:41,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {33356#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33357#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:41,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {33357#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33357#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:41,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {33357#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33358#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:41,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {33358#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33358#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:41,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {33358#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33359#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:41,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {33359#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33359#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:41,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {33359#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33360#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:41,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {33360#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33360#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:41,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {33360#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33361#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:41,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {33361#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33361#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:41,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {33361#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33362#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:41,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {33362#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33362#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:41,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {33362#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33363#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:41,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {33363#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33363#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:41,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {33363#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33364#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:41,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {33364#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33364#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:41,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {33364#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33365#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:41,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {33365#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33365#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:41,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {33365#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33366#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:41,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {33366#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33366#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:41,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {33366#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33367#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:41,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {33367#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33367#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:41,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {33367#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33368#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:41,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {33368#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33368#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:41,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {33368#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33369#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:41,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {33369#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33369#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:41,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {33369#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33370#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:41,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {33370#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33370#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:41,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {33370#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33371#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:41,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {33371#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33371#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:41,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {33371#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33372#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:41,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {33372#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33372#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:41,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {33372#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33373#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:41,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {33373#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33373#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:41,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {33373#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33374#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:41,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {33374#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33374#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:41,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {33374#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33375#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:41,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {33375#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33375#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:41,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {33375#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33376#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:41,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {33376#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33376#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:41,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {33376#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33377#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:41,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {33377#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33377#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:41,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {33377#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33378#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:41,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {33378#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33378#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:41,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {33378#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33379#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:41,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {33379#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33379#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:41,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {33379#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33380#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:41,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {33380#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33380#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:41,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {33380#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33381#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:41,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {33381#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33381#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:41,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {33381#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33382#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:41,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {33382#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33382#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:41,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {33382#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33383#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:41,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {33383#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33383#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:41,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {33383#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33384#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:41,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {33384#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33384#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:41,504 INFO L290 TraceCheckUtils]: 67: Hoare triple {33384#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33385#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:41,505 INFO L290 TraceCheckUtils]: 68: Hoare triple {33385#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33385#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:41,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {33385#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33386#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:41,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {33386#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33386#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:41,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {33386#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33387#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:41,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {33387#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33387#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:41,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {33387#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33388#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:41,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {33388#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33388#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:41,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {33388#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33389#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:41,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {33389#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33389#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:41,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {33389#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33390#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:41,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {33390#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33390#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:41,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {33390#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33391#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:41,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {33391#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33391#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:41,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {33391#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33392#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:41,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {33392#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33392#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:41,511 INFO L290 TraceCheckUtils]: 83: Hoare triple {33392#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33393#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:41,511 INFO L290 TraceCheckUtils]: 84: Hoare triple {33393#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33393#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:41,511 INFO L290 TraceCheckUtils]: 85: Hoare triple {33393#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33394#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:41,512 INFO L290 TraceCheckUtils]: 86: Hoare triple {33394#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33394#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:41,512 INFO L290 TraceCheckUtils]: 87: Hoare triple {33394#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33395#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:41,512 INFO L290 TraceCheckUtils]: 88: Hoare triple {33395#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33395#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:41,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {33395#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33396#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:41,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {33396#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33396#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:41,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {33396#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33397#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:41,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {33397#(<= main_~i~0 43)} assume !(~i~0 < 1024); {33350#false} is VALID [2022-04-15 05:49:41,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {33350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {33350#false} is VALID [2022-04-15 05:49:41,514 INFO L272 TraceCheckUtils]: 94: Hoare triple {33350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {33350#false} is VALID [2022-04-15 05:49:41,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {33350#false} ~cond := #in~cond; {33350#false} is VALID [2022-04-15 05:49:41,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {33350#false} assume 0 == ~cond; {33350#false} is VALID [2022-04-15 05:49:41,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2022-04-15 05:49:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:41,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:49:43,827 INFO L290 TraceCheckUtils]: 97: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2022-04-15 05:49:43,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {33350#false} assume 0 == ~cond; {33350#false} is VALID [2022-04-15 05:49:43,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {33350#false} ~cond := #in~cond; {33350#false} is VALID [2022-04-15 05:49:43,828 INFO L272 TraceCheckUtils]: 94: Hoare triple {33350#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {33350#false} is VALID [2022-04-15 05:49:43,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {33350#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {33350#false} is VALID [2022-04-15 05:49:43,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {33709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {33350#false} is VALID [2022-04-15 05:49:43,828 INFO L290 TraceCheckUtils]: 91: Hoare triple {33713#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33709#(< main_~i~0 1024)} is VALID [2022-04-15 05:49:43,829 INFO L290 TraceCheckUtils]: 90: Hoare triple {33713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33713#(< main_~i~0 1023)} is VALID [2022-04-15 05:49:43,829 INFO L290 TraceCheckUtils]: 89: Hoare triple {33720#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33713#(< main_~i~0 1023)} is VALID [2022-04-15 05:49:43,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {33720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33720#(< main_~i~0 1022)} is VALID [2022-04-15 05:49:43,830 INFO L290 TraceCheckUtils]: 87: Hoare triple {33727#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33720#(< main_~i~0 1022)} is VALID [2022-04-15 05:49:43,830 INFO L290 TraceCheckUtils]: 86: Hoare triple {33727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33727#(< main_~i~0 1021)} is VALID [2022-04-15 05:49:43,830 INFO L290 TraceCheckUtils]: 85: Hoare triple {33734#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33727#(< main_~i~0 1021)} is VALID [2022-04-15 05:49:43,831 INFO L290 TraceCheckUtils]: 84: Hoare triple {33734#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33734#(< main_~i~0 1020)} is VALID [2022-04-15 05:49:43,831 INFO L290 TraceCheckUtils]: 83: Hoare triple {33741#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33734#(< main_~i~0 1020)} is VALID [2022-04-15 05:49:43,831 INFO L290 TraceCheckUtils]: 82: Hoare triple {33741#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33741#(< main_~i~0 1019)} is VALID [2022-04-15 05:49:43,832 INFO L290 TraceCheckUtils]: 81: Hoare triple {33748#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33741#(< main_~i~0 1019)} is VALID [2022-04-15 05:49:43,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {33748#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33748#(< main_~i~0 1018)} is VALID [2022-04-15 05:49:43,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {33755#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33748#(< main_~i~0 1018)} is VALID [2022-04-15 05:49:43,832 INFO L290 TraceCheckUtils]: 78: Hoare triple {33755#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33755#(< main_~i~0 1017)} is VALID [2022-04-15 05:49:43,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {33762#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33755#(< main_~i~0 1017)} is VALID [2022-04-15 05:49:43,833 INFO L290 TraceCheckUtils]: 76: Hoare triple {33762#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33762#(< main_~i~0 1016)} is VALID [2022-04-15 05:49:43,833 INFO L290 TraceCheckUtils]: 75: Hoare triple {33769#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33762#(< main_~i~0 1016)} is VALID [2022-04-15 05:49:43,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {33769#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33769#(< main_~i~0 1015)} is VALID [2022-04-15 05:49:43,834 INFO L290 TraceCheckUtils]: 73: Hoare triple {33776#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33769#(< main_~i~0 1015)} is VALID [2022-04-15 05:49:43,834 INFO L290 TraceCheckUtils]: 72: Hoare triple {33776#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33776#(< main_~i~0 1014)} is VALID [2022-04-15 05:49:43,835 INFO L290 TraceCheckUtils]: 71: Hoare triple {33783#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33776#(< main_~i~0 1014)} is VALID [2022-04-15 05:49:43,835 INFO L290 TraceCheckUtils]: 70: Hoare triple {33783#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33783#(< main_~i~0 1013)} is VALID [2022-04-15 05:49:43,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {33790#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33783#(< main_~i~0 1013)} is VALID [2022-04-15 05:49:43,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {33790#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33790#(< main_~i~0 1012)} is VALID [2022-04-15 05:49:43,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {33797#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33790#(< main_~i~0 1012)} is VALID [2022-04-15 05:49:43,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {33797#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33797#(< main_~i~0 1011)} is VALID [2022-04-15 05:49:43,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {33804#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33797#(< main_~i~0 1011)} is VALID [2022-04-15 05:49:43,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {33804#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33804#(< main_~i~0 1010)} is VALID [2022-04-15 05:49:43,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {33811#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33804#(< main_~i~0 1010)} is VALID [2022-04-15 05:49:43,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {33811#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33811#(< main_~i~0 1009)} is VALID [2022-04-15 05:49:43,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {33818#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33811#(< main_~i~0 1009)} is VALID [2022-04-15 05:49:43,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {33818#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33818#(< main_~i~0 1008)} is VALID [2022-04-15 05:49:43,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {33825#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33818#(< main_~i~0 1008)} is VALID [2022-04-15 05:49:43,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {33825#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33825#(< main_~i~0 1007)} is VALID [2022-04-15 05:49:43,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {33832#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33825#(< main_~i~0 1007)} is VALID [2022-04-15 05:49:43,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {33832#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33832#(< main_~i~0 1006)} is VALID [2022-04-15 05:49:43,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {33839#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33832#(< main_~i~0 1006)} is VALID [2022-04-15 05:49:43,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {33839#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33839#(< main_~i~0 1005)} is VALID [2022-04-15 05:49:43,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {33846#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33839#(< main_~i~0 1005)} is VALID [2022-04-15 05:49:43,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {33846#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33846#(< main_~i~0 1004)} is VALID [2022-04-15 05:49:43,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {33853#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33846#(< main_~i~0 1004)} is VALID [2022-04-15 05:49:43,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {33853#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33853#(< main_~i~0 1003)} is VALID [2022-04-15 05:49:43,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {33860#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33853#(< main_~i~0 1003)} is VALID [2022-04-15 05:49:43,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {33860#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33860#(< main_~i~0 1002)} is VALID [2022-04-15 05:49:43,845 INFO L290 TraceCheckUtils]: 47: Hoare triple {33867#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33860#(< main_~i~0 1002)} is VALID [2022-04-15 05:49:43,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {33867#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33867#(< main_~i~0 1001)} is VALID [2022-04-15 05:49:43,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {33874#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33867#(< main_~i~0 1001)} is VALID [2022-04-15 05:49:43,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {33874#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33874#(< main_~i~0 1000)} is VALID [2022-04-15 05:49:43,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {33881#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33874#(< main_~i~0 1000)} is VALID [2022-04-15 05:49:43,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {33881#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33881#(< main_~i~0 999)} is VALID [2022-04-15 05:49:43,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {33888#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33881#(< main_~i~0 999)} is VALID [2022-04-15 05:49:43,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {33888#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33888#(< main_~i~0 998)} is VALID [2022-04-15 05:49:43,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {33895#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33888#(< main_~i~0 998)} is VALID [2022-04-15 05:49:43,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {33895#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33895#(< main_~i~0 997)} is VALID [2022-04-15 05:49:43,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {33902#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33895#(< main_~i~0 997)} is VALID [2022-04-15 05:49:43,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {33902#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33902#(< main_~i~0 996)} is VALID [2022-04-15 05:49:43,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {33909#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33902#(< main_~i~0 996)} is VALID [2022-04-15 05:49:43,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {33909#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33909#(< main_~i~0 995)} is VALID [2022-04-15 05:49:43,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {33916#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33909#(< main_~i~0 995)} is VALID [2022-04-15 05:49:43,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {33916#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33916#(< main_~i~0 994)} is VALID [2022-04-15 05:49:43,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {33923#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33916#(< main_~i~0 994)} is VALID [2022-04-15 05:49:43,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {33923#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33923#(< main_~i~0 993)} is VALID [2022-04-15 05:49:43,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {33930#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33923#(< main_~i~0 993)} is VALID [2022-04-15 05:49:43,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {33930#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33930#(< main_~i~0 992)} is VALID [2022-04-15 05:49:43,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {33937#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33930#(< main_~i~0 992)} is VALID [2022-04-15 05:49:43,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {33937#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33937#(< main_~i~0 991)} is VALID [2022-04-15 05:49:43,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {33944#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33937#(< main_~i~0 991)} is VALID [2022-04-15 05:49:43,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {33944#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33944#(< main_~i~0 990)} is VALID [2022-04-15 05:49:43,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {33951#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33944#(< main_~i~0 990)} is VALID [2022-04-15 05:49:43,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {33951#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33951#(< main_~i~0 989)} is VALID [2022-04-15 05:49:43,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {33958#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33951#(< main_~i~0 989)} is VALID [2022-04-15 05:49:43,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {33958#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33958#(< main_~i~0 988)} is VALID [2022-04-15 05:49:43,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {33965#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33958#(< main_~i~0 988)} is VALID [2022-04-15 05:49:43,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {33965#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33965#(< main_~i~0 987)} is VALID [2022-04-15 05:49:43,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {33972#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33965#(< main_~i~0 987)} is VALID [2022-04-15 05:49:43,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {33972#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33972#(< main_~i~0 986)} is VALID [2022-04-15 05:49:43,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {33979#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33972#(< main_~i~0 986)} is VALID [2022-04-15 05:49:43,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {33979#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33979#(< main_~i~0 985)} is VALID [2022-04-15 05:49:43,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {33986#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33979#(< main_~i~0 985)} is VALID [2022-04-15 05:49:43,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {33986#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33986#(< main_~i~0 984)} is VALID [2022-04-15 05:49:43,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {33993#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33986#(< main_~i~0 984)} is VALID [2022-04-15 05:49:43,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {33993#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33993#(< main_~i~0 983)} is VALID [2022-04-15 05:49:43,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {34000#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {33993#(< main_~i~0 983)} is VALID [2022-04-15 05:49:43,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {34000#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34000#(< main_~i~0 982)} is VALID [2022-04-15 05:49:43,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {34007#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34000#(< main_~i~0 982)} is VALID [2022-04-15 05:49:43,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {34007#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34007#(< main_~i~0 981)} is VALID [2022-04-15 05:49:43,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {33349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {34007#(< main_~i~0 981)} is VALID [2022-04-15 05:49:43,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret6 := main(); {33349#true} is VALID [2022-04-15 05:49:43,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #39#return; {33349#true} is VALID [2022-04-15 05:49:43,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2022-04-15 05:49:43,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {33349#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(12, 2);call #Ultimate.allocInit(12, 3); {33349#true} is VALID [2022-04-15 05:49:43,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33349#true} is VALID [2022-04-15 05:49:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:43,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251301236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:49:43,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:49:43,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 05:49:43,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:49:43,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703187254] [2022-04-15 05:49:43,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703187254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:49:43,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:49:43,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 05:49:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822267886] [2022-04-15 05:49:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:49:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 05:49:43,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:49:43,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:43,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:43,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 05:49:43,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:49:43,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 05:49:43,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 05:49:43,936 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:45,412 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-15 05:49:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 05:49:45,413 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 05:49:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:49:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-15 05:49:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-15 05:49:45,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 108 transitions. [2022-04-15 05:49:45,491 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-15 05:49:45,492 INFO L225 Difference]: With dead ends: 108 [2022-04-15 05:49:45,492 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 05:49:45,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 05:49:45,494 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:49:45,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 39 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:49:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 05:49:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-04-15 05:49:45,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:49:45,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,921 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,921 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:45,922 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-15 05:49:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-15 05:49:45,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:49:45,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:49:45,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-15 05:49:45,923 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-15 05:49:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:45,924 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-15 05:49:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-15 05:49:45,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:49:45,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:49:45,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:49:45,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:49:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2022-04-15 05:49:45,926 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2022-04-15 05:49:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:49:45,926 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2022-04-15 05:49:45,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:45,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 101 transitions. [2022-04-15 05:49:46,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-04-15 05:49:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 05:49:46,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:49:46,057 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:49:46,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 05:49:46,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 05:49:46,257 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:49:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:49:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash -751648046, now seen corresponding path program 87 times [2022-04-15 05:49:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:49:46,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225966734] [2022-04-15 05:49:46,260 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:49:46,260 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:49:46,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:49:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash -751648046, now seen corresponding path program 88 times [2022-04-15 05:49:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:49:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798853312] [2022-04-15 05:49:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:49:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:49:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:49:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:47,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {34791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-15 05:49:47,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-15 05:49:47,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-15 05:49:47,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {34741#true} call ULTIMATE.init(); {34791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:49:47,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {34791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-15 05:49:47,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-15 05:49:47,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-15 05:49:47,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {34741#true} call #t~ret6 := main(); {34741#true} is VALID [2022-04-15 05:49:47,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {34741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {34746#(= main_~i~0 0)} is VALID [2022-04-15 05:49:47,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {34746#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34746#(= main_~i~0 0)} is VALID [2022-04-15 05:49:47,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {34746#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34747#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:47,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {34747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34747#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:47,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {34747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34748#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:47,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {34748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34748#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:47,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {34748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34749#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:47,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {34749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34749#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:47,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {34749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34750#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:47,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {34750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34750#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:47,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {34750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34751#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:47,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {34751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34751#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:47,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {34751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34752#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:47,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {34752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34752#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:47,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {34752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34753#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:47,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {34753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34753#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:47,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {34753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34754#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:47,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {34754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34754#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:47,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {34754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34755#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:47,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {34755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34755#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:47,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {34755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34756#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:47,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {34756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34756#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:47,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {34756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34757#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:47,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {34757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34757#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:47,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {34757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34758#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:47,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {34758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34758#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:47,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {34758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34759#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:47,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {34759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34759#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:47,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {34759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34760#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:47,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {34760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34760#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:47,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {34760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34761#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:47,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {34761#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34761#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:47,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {34761#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34762#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:47,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {34762#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34762#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:47,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {34762#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34763#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:47,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {34763#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34763#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:47,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {34763#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34764#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:47,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {34764#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34764#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:47,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {34764#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34765#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:47,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {34765#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34765#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:47,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {34765#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34766#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:47,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {34766#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34766#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:47,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {34766#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34767#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:47,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {34767#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34767#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:47,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {34767#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34768#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:47,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {34768#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34768#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:47,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {34768#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34769#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:47,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {34769#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34769#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:47,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {34769#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34770#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:47,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {34770#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34770#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:47,117 INFO L290 TraceCheckUtils]: 55: Hoare triple {34770#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34771#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:47,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {34771#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34771#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:47,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {34771#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34772#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:47,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {34772#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34772#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:47,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {34772#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34773#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:47,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {34773#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34773#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:47,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {34773#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34774#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:47,119 INFO L290 TraceCheckUtils]: 62: Hoare triple {34774#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34774#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:47,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {34774#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34775#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:47,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {34775#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34775#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:47,120 INFO L290 TraceCheckUtils]: 65: Hoare triple {34775#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34776#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:47,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {34776#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34776#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:47,120 INFO L290 TraceCheckUtils]: 67: Hoare triple {34776#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34777#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:47,121 INFO L290 TraceCheckUtils]: 68: Hoare triple {34777#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34777#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:47,121 INFO L290 TraceCheckUtils]: 69: Hoare triple {34777#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34778#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:47,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {34778#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34778#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:47,122 INFO L290 TraceCheckUtils]: 71: Hoare triple {34778#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34779#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:47,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {34779#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34779#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:47,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {34779#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34780#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:47,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {34780#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34780#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:47,123 INFO L290 TraceCheckUtils]: 75: Hoare triple {34780#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34781#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:47,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {34781#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34781#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:47,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {34781#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34782#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:47,124 INFO L290 TraceCheckUtils]: 78: Hoare triple {34782#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34782#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:47,124 INFO L290 TraceCheckUtils]: 79: Hoare triple {34782#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34783#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:47,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {34783#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34783#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:47,125 INFO L290 TraceCheckUtils]: 81: Hoare triple {34783#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34784#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:47,125 INFO L290 TraceCheckUtils]: 82: Hoare triple {34784#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34784#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:47,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {34784#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34785#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:47,125 INFO L290 TraceCheckUtils]: 84: Hoare triple {34785#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34785#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:47,126 INFO L290 TraceCheckUtils]: 85: Hoare triple {34785#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34786#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:47,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {34786#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34786#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:47,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {34786#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34787#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:47,127 INFO L290 TraceCheckUtils]: 88: Hoare triple {34787#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34787#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:47,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {34787#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34788#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:47,127 INFO L290 TraceCheckUtils]: 90: Hoare triple {34788#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34788#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:47,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {34788#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34789#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:47,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {34789#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34789#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:47,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {34789#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34790#(<= main_~i~0 44)} is VALID [2022-04-15 05:49:47,129 INFO L290 TraceCheckUtils]: 94: Hoare triple {34790#(<= main_~i~0 44)} assume !(~i~0 < 1024); {34742#false} is VALID [2022-04-15 05:49:47,129 INFO L290 TraceCheckUtils]: 95: Hoare triple {34742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {34742#false} is VALID [2022-04-15 05:49:47,129 INFO L272 TraceCheckUtils]: 96: Hoare triple {34742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {34742#false} is VALID [2022-04-15 05:49:47,129 INFO L290 TraceCheckUtils]: 97: Hoare triple {34742#false} ~cond := #in~cond; {34742#false} is VALID [2022-04-15 05:49:47,129 INFO L290 TraceCheckUtils]: 98: Hoare triple {34742#false} assume 0 == ~cond; {34742#false} is VALID [2022-04-15 05:49:47,129 INFO L290 TraceCheckUtils]: 99: Hoare triple {34742#false} assume !false; {34742#false} is VALID [2022-04-15 05:49:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:49:47,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798853312] [2022-04-15 05:49:47,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798853312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:49:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027922686] [2022-04-15 05:49:47,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:49:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:49:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:49:47,132 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:49:47,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 05:49:47,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:49:47,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:49:47,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-15 05:49:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:47,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:49:47,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {34741#true} call ULTIMATE.init(); {34741#true} is VALID [2022-04-15 05:49:47,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {34741#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(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-15 05:49:47,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-15 05:49:47,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-15 05:49:47,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {34741#true} call #t~ret6 := main(); {34741#true} is VALID [2022-04-15 05:49:47,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {34741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {34810#(<= main_~i~0 0)} is VALID [2022-04-15 05:49:47,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {34810#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34810#(<= main_~i~0 0)} is VALID [2022-04-15 05:49:47,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {34810#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34747#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:47,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {34747#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34747#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:47,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {34747#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34748#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:47,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {34748#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34748#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:47,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {34748#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34749#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:47,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {34749#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34749#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:47,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {34749#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34750#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:47,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {34750#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34750#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:47,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {34750#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34751#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:47,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {34751#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34751#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:47,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {34751#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34752#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:47,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {34752#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34752#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:47,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {34752#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34753#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:47,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {34753#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34753#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:47,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {34753#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34754#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:47,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {34754#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34754#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:47,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {34754#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34755#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:47,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {34755#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34755#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:47,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {34755#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34756#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:47,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {34756#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34756#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:47,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {34756#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34757#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:47,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {34757#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34757#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:47,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {34757#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34758#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:47,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {34758#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34758#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:47,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {34758#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34759#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:47,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {34759#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34759#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:47,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {34759#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34760#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:47,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {34760#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34760#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:47,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {34760#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34761#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:47,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {34761#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34761#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:47,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {34761#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34762#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:47,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {34762#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34762#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:47,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {34762#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34763#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:47,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {34763#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34763#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:47,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {34763#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34764#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:47,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {34764#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34764#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:47,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {34764#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34765#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:47,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {34765#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34765#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:47,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {34765#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34766#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:47,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {34766#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34766#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:47,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {34766#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34767#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:47,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {34767#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34767#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:47,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {34767#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34768#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:47,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {34768#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34768#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:47,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {34768#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34769#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:47,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {34769#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34769#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:47,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {34769#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34770#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:47,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {34770#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34770#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:47,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {34770#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34771#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:47,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {34771#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34771#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:47,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {34771#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34772#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:47,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {34772#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34772#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:47,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {34772#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34773#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:47,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {34773#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34773#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:47,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {34773#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34774#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:47,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {34774#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34774#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:47,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {34774#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34775#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:47,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {34775#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34775#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:47,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {34775#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34776#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:47,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {34776#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34776#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:47,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {34776#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34777#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:47,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {34777#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34777#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:47,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {34777#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34778#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:47,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {34778#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34778#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:47,997 INFO L290 TraceCheckUtils]: 71: Hoare triple {34778#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34779#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:47,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {34779#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34779#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:47,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {34779#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34780#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:47,998 INFO L290 TraceCheckUtils]: 74: Hoare triple {34780#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34780#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:47,998 INFO L290 TraceCheckUtils]: 75: Hoare triple {34780#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34781#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:47,998 INFO L290 TraceCheckUtils]: 76: Hoare triple {34781#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34781#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:47,998 INFO L290 TraceCheckUtils]: 77: Hoare triple {34781#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34782#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:47,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {34782#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34782#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:47,999 INFO L290 TraceCheckUtils]: 79: Hoare triple {34782#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34783#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:47,999 INFO L290 TraceCheckUtils]: 80: Hoare triple {34783#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34783#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:48,000 INFO L290 TraceCheckUtils]: 81: Hoare triple {34783#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34784#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:48,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {34784#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34784#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:48,000 INFO L290 TraceCheckUtils]: 83: Hoare triple {34784#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34785#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:48,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {34785#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34785#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:48,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {34785#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34786#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:48,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {34786#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34786#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:48,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {34786#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34787#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:48,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {34787#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34787#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:48,002 INFO L290 TraceCheckUtils]: 89: Hoare triple {34787#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34788#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:48,002 INFO L290 TraceCheckUtils]: 90: Hoare triple {34788#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34788#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:48,003 INFO L290 TraceCheckUtils]: 91: Hoare triple {34788#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34789#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:48,003 INFO L290 TraceCheckUtils]: 92: Hoare triple {34789#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34789#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:48,003 INFO L290 TraceCheckUtils]: 93: Hoare triple {34789#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {34790#(<= main_~i~0 44)} is VALID [2022-04-15 05:49:48,004 INFO L290 TraceCheckUtils]: 94: Hoare triple {34790#(<= main_~i~0 44)} assume !(~i~0 < 1024); {34742#false} is VALID [2022-04-15 05:49:48,004 INFO L290 TraceCheckUtils]: 95: Hoare triple {34742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {34742#false} is VALID [2022-04-15 05:49:48,004 INFO L272 TraceCheckUtils]: 96: Hoare triple {34742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {34742#false} is VALID [2022-04-15 05:49:48,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {34742#false} ~cond := #in~cond; {34742#false} is VALID [2022-04-15 05:49:48,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {34742#false} assume 0 == ~cond; {34742#false} is VALID [2022-04-15 05:49:48,004 INFO L290 TraceCheckUtils]: 99: Hoare triple {34742#false} assume !false; {34742#false} is VALID [2022-04-15 05:49:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:48,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:49:50,404 INFO L290 TraceCheckUtils]: 99: Hoare triple {34742#false} assume !false; {34742#false} is VALID [2022-04-15 05:49:50,404 INFO L290 TraceCheckUtils]: 98: Hoare triple {34742#false} assume 0 == ~cond; {34742#false} is VALID [2022-04-15 05:49:50,404 INFO L290 TraceCheckUtils]: 97: Hoare triple {34742#false} ~cond := #in~cond; {34742#false} is VALID [2022-04-15 05:49:50,404 INFO L272 TraceCheckUtils]: 96: Hoare triple {34742#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {34742#false} is VALID [2022-04-15 05:49:50,404 INFO L290 TraceCheckUtils]: 95: Hoare triple {34742#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {34742#false} is VALID [2022-04-15 05:49:50,404 INFO L290 TraceCheckUtils]: 94: Hoare triple {35108#(< main_~i~0 1024)} assume !(~i~0 < 1024); {34742#false} is VALID [2022-04-15 05:49:50,405 INFO L290 TraceCheckUtils]: 93: Hoare triple {35112#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35108#(< main_~i~0 1024)} is VALID [2022-04-15 05:49:50,405 INFO L290 TraceCheckUtils]: 92: Hoare triple {35112#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35112#(< main_~i~0 1023)} is VALID [2022-04-15 05:49:50,405 INFO L290 TraceCheckUtils]: 91: Hoare triple {35119#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35112#(< main_~i~0 1023)} is VALID [2022-04-15 05:49:50,406 INFO L290 TraceCheckUtils]: 90: Hoare triple {35119#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35119#(< main_~i~0 1022)} is VALID [2022-04-15 05:49:50,406 INFO L290 TraceCheckUtils]: 89: Hoare triple {35126#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35119#(< main_~i~0 1022)} is VALID [2022-04-15 05:49:50,406 INFO L290 TraceCheckUtils]: 88: Hoare triple {35126#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35126#(< main_~i~0 1021)} is VALID [2022-04-15 05:49:50,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {35133#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35126#(< main_~i~0 1021)} is VALID [2022-04-15 05:49:50,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {35133#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35133#(< main_~i~0 1020)} is VALID [2022-04-15 05:49:50,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {35140#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35133#(< main_~i~0 1020)} is VALID [2022-04-15 05:49:50,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {35140#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35140#(< main_~i~0 1019)} is VALID [2022-04-15 05:49:50,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {35147#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35140#(< main_~i~0 1019)} is VALID [2022-04-15 05:49:50,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {35147#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35147#(< main_~i~0 1018)} is VALID [2022-04-15 05:49:50,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {35154#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35147#(< main_~i~0 1018)} is VALID [2022-04-15 05:49:50,409 INFO L290 TraceCheckUtils]: 80: Hoare triple {35154#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35154#(< main_~i~0 1017)} is VALID [2022-04-15 05:49:50,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {35161#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35154#(< main_~i~0 1017)} is VALID [2022-04-15 05:49:50,409 INFO L290 TraceCheckUtils]: 78: Hoare triple {35161#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35161#(< main_~i~0 1016)} is VALID [2022-04-15 05:49:50,410 INFO L290 TraceCheckUtils]: 77: Hoare triple {35168#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35161#(< main_~i~0 1016)} is VALID [2022-04-15 05:49:50,410 INFO L290 TraceCheckUtils]: 76: Hoare triple {35168#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35168#(< main_~i~0 1015)} is VALID [2022-04-15 05:49:50,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {35175#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35168#(< main_~i~0 1015)} is VALID [2022-04-15 05:49:50,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {35175#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35175#(< main_~i~0 1014)} is VALID [2022-04-15 05:49:50,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {35182#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35175#(< main_~i~0 1014)} is VALID [2022-04-15 05:49:50,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {35182#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35182#(< main_~i~0 1013)} is VALID [2022-04-15 05:49:50,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {35189#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35182#(< main_~i~0 1013)} is VALID [2022-04-15 05:49:50,412 INFO L290 TraceCheckUtils]: 70: Hoare triple {35189#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35189#(< main_~i~0 1012)} is VALID [2022-04-15 05:49:50,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {35196#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35189#(< main_~i~0 1012)} is VALID [2022-04-15 05:49:50,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {35196#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35196#(< main_~i~0 1011)} is VALID [2022-04-15 05:49:50,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {35203#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35196#(< main_~i~0 1011)} is VALID [2022-04-15 05:49:50,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {35203#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35203#(< main_~i~0 1010)} is VALID [2022-04-15 05:49:50,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {35210#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35203#(< main_~i~0 1010)} is VALID [2022-04-15 05:49:50,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {35210#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35210#(< main_~i~0 1009)} is VALID [2022-04-15 05:49:50,414 INFO L290 TraceCheckUtils]: 63: Hoare triple {35217#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35210#(< main_~i~0 1009)} is VALID [2022-04-15 05:49:50,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {35217#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35217#(< main_~i~0 1008)} is VALID [2022-04-15 05:49:50,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {35224#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35217#(< main_~i~0 1008)} is VALID [2022-04-15 05:49:50,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {35224#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35224#(< main_~i~0 1007)} is VALID [2022-04-15 05:49:50,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {35231#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35224#(< main_~i~0 1007)} is VALID [2022-04-15 05:49:50,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {35231#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35231#(< main_~i~0 1006)} is VALID [2022-04-15 05:49:50,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {35238#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35231#(< main_~i~0 1006)} is VALID [2022-04-15 05:49:50,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {35238#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35238#(< main_~i~0 1005)} is VALID [2022-04-15 05:49:50,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {35245#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35238#(< main_~i~0 1005)} is VALID [2022-04-15 05:49:50,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {35245#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35245#(< main_~i~0 1004)} is VALID [2022-04-15 05:49:50,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {35252#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35245#(< main_~i~0 1004)} is VALID [2022-04-15 05:49:50,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {35252#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35252#(< main_~i~0 1003)} is VALID [2022-04-15 05:49:50,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {35259#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35252#(< main_~i~0 1003)} is VALID [2022-04-15 05:49:50,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {35259#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35259#(< main_~i~0 1002)} is VALID [2022-04-15 05:49:50,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {35266#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35259#(< main_~i~0 1002)} is VALID [2022-04-15 05:49:50,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {35266#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35266#(< main_~i~0 1001)} is VALID [2022-04-15 05:49:50,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {35273#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35266#(< main_~i~0 1001)} is VALID [2022-04-15 05:49:50,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {35273#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35273#(< main_~i~0 1000)} is VALID [2022-04-15 05:49:50,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {35280#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35273#(< main_~i~0 1000)} is VALID [2022-04-15 05:49:50,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {35280#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35280#(< main_~i~0 999)} is VALID [2022-04-15 05:49:50,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {35287#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35280#(< main_~i~0 999)} is VALID [2022-04-15 05:49:50,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {35287#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35287#(< main_~i~0 998)} is VALID [2022-04-15 05:49:50,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {35294#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35287#(< main_~i~0 998)} is VALID [2022-04-15 05:49:50,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {35294#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35294#(< main_~i~0 997)} is VALID [2022-04-15 05:49:50,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {35301#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35294#(< main_~i~0 997)} is VALID [2022-04-15 05:49:50,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {35301#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35301#(< main_~i~0 996)} is VALID [2022-04-15 05:49:50,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {35308#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35301#(< main_~i~0 996)} is VALID [2022-04-15 05:49:50,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {35308#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35308#(< main_~i~0 995)} is VALID [2022-04-15 05:49:50,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {35315#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35308#(< main_~i~0 995)} is VALID [2022-04-15 05:49:50,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {35315#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35315#(< main_~i~0 994)} is VALID [2022-04-15 05:49:50,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {35322#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35315#(< main_~i~0 994)} is VALID [2022-04-15 05:49:50,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {35322#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35322#(< main_~i~0 993)} is VALID [2022-04-15 05:49:50,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {35329#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35322#(< main_~i~0 993)} is VALID [2022-04-15 05:49:50,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {35329#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35329#(< main_~i~0 992)} is VALID [2022-04-15 05:49:50,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {35336#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35329#(< main_~i~0 992)} is VALID [2022-04-15 05:49:50,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {35336#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35336#(< main_~i~0 991)} is VALID [2022-04-15 05:49:50,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {35343#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35336#(< main_~i~0 991)} is VALID [2022-04-15 05:49:50,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {35343#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35343#(< main_~i~0 990)} is VALID [2022-04-15 05:49:50,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {35350#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35343#(< main_~i~0 990)} is VALID [2022-04-15 05:49:50,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {35350#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35350#(< main_~i~0 989)} is VALID [2022-04-15 05:49:50,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {35357#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35350#(< main_~i~0 989)} is VALID [2022-04-15 05:49:50,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {35357#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35357#(< main_~i~0 988)} is VALID [2022-04-15 05:49:50,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {35364#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35357#(< main_~i~0 988)} is VALID [2022-04-15 05:49:50,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {35364#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35364#(< main_~i~0 987)} is VALID [2022-04-15 05:49:50,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {35371#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35364#(< main_~i~0 987)} is VALID [2022-04-15 05:49:50,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {35371#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35371#(< main_~i~0 986)} is VALID [2022-04-15 05:49:50,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {35378#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35371#(< main_~i~0 986)} is VALID [2022-04-15 05:49:50,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {35378#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35378#(< main_~i~0 985)} is VALID [2022-04-15 05:49:50,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {35385#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35378#(< main_~i~0 985)} is VALID [2022-04-15 05:49:50,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {35385#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35385#(< main_~i~0 984)} is VALID [2022-04-15 05:49:50,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {35392#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35385#(< main_~i~0 984)} is VALID [2022-04-15 05:49:50,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {35392#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35392#(< main_~i~0 983)} is VALID [2022-04-15 05:49:50,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {35399#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35392#(< main_~i~0 983)} is VALID [2022-04-15 05:49:50,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {35399#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35399#(< main_~i~0 982)} is VALID [2022-04-15 05:49:50,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {35406#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35399#(< main_~i~0 982)} is VALID [2022-04-15 05:49:50,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {35406#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35406#(< main_~i~0 981)} is VALID [2022-04-15 05:49:50,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {35413#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {35406#(< main_~i~0 981)} is VALID [2022-04-15 05:49:50,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {35413#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {35413#(< main_~i~0 980)} is VALID [2022-04-15 05:49:50,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {34741#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {35413#(< main_~i~0 980)} is VALID [2022-04-15 05:49:50,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {34741#true} call #t~ret6 := main(); {34741#true} is VALID [2022-04-15 05:49:50,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34741#true} {34741#true} #39#return; {34741#true} is VALID [2022-04-15 05:49:50,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {34741#true} assume true; {34741#true} is VALID [2022-04-15 05:49:50,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {34741#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(12, 2);call #Ultimate.allocInit(12, 3); {34741#true} is VALID [2022-04-15 05:49:50,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {34741#true} call ULTIMATE.init(); {34741#true} is VALID [2022-04-15 05:49:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027922686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:49:50,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:49:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-15 05:49:50,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:49:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225966734] [2022-04-15 05:49:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225966734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:49:50,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:49:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 05:49:50,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127417652] [2022-04-15 05:49:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:49:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 05:49:50,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:49:50,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:50,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:50,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 05:49:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:49:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 05:49:50,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 05:49:50,503 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:52,009 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-15 05:49:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 05:49:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 05:49:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:49:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-15 05:49:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-15 05:49:52,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 110 transitions. [2022-04-15 05:49:52,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:49:52,105 INFO L225 Difference]: With dead ends: 110 [2022-04-15 05:49:52,105 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 05:49:52,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8466, Invalid=10716, Unknown=0, NotChecked=0, Total=19182 [2022-04-15 05:49:52,107 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:49:52,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 29 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:49:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 05:49:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-04-15 05:49:52,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:49:52,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,538 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,538 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:52,539 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-15 05:49:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-15 05:49:52,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:49:52,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:49:52,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 05:49:52,539 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-15 05:49:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:49:52,540 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-15 05:49:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-15 05:49:52,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:49:52,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:49:52,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:49:52,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:49:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2022-04-15 05:49:52,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2022-04-15 05:49:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:49:52,542 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2022-04-15 05:49:52,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:49:52,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 103 transitions. [2022-04-15 05:49:52,662 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-15 05:49:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-15 05:49:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 05:49:52,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:49:52,663 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:49:52,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-15 05:49:52,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 05:49:52,864 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:49:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:49:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1653354028, now seen corresponding path program 89 times [2022-04-15 05:49:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:49:52,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [471058765] [2022-04-15 05:49:52,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:49:52,869 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:49:52,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:49:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1653354028, now seen corresponding path program 90 times [2022-04-15 05:49:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:49:52,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529957977] [2022-04-15 05:49:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:49:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:49:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:49:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:49:53,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {36212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-15 05:49:53,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-15 05:49:53,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-15 05:49:53,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {36161#true} call ULTIMATE.init(); {36212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:49:53,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {36212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-15 05:49:53,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-15 05:49:53,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-15 05:49:53,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {36161#true} call #t~ret6 := main(); {36161#true} is VALID [2022-04-15 05:49:53,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {36161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {36166#(= main_~i~0 0)} is VALID [2022-04-15 05:49:53,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {36166#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36166#(= main_~i~0 0)} is VALID [2022-04-15 05:49:53,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {36166#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36167#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:53,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {36167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36167#(<= main_~i~0 1)} is VALID [2022-04-15 05:49:53,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {36167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36168#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:53,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {36168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36168#(<= main_~i~0 2)} is VALID [2022-04-15 05:49:53,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {36168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36169#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:53,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {36169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36169#(<= main_~i~0 3)} is VALID [2022-04-15 05:49:53,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {36169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36170#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:53,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {36170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36170#(<= main_~i~0 4)} is VALID [2022-04-15 05:49:53,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {36170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36171#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:53,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {36171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36171#(<= main_~i~0 5)} is VALID [2022-04-15 05:49:53,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {36171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36172#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:53,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {36172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36172#(<= main_~i~0 6)} is VALID [2022-04-15 05:49:53,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {36172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36173#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:53,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {36173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36173#(<= main_~i~0 7)} is VALID [2022-04-15 05:49:53,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {36173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36174#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:53,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {36174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36174#(<= main_~i~0 8)} is VALID [2022-04-15 05:49:53,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {36174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36175#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:53,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {36175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36175#(<= main_~i~0 9)} is VALID [2022-04-15 05:49:53,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {36175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36176#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:53,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {36176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36176#(<= main_~i~0 10)} is VALID [2022-04-15 05:49:53,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {36176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36177#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:53,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {36177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36177#(<= main_~i~0 11)} is VALID [2022-04-15 05:49:53,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {36177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36178#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:53,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {36178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36178#(<= main_~i~0 12)} is VALID [2022-04-15 05:49:53,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {36178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36179#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:53,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {36179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36179#(<= main_~i~0 13)} is VALID [2022-04-15 05:49:53,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {36179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36180#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:53,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {36180#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36180#(<= main_~i~0 14)} is VALID [2022-04-15 05:49:53,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {36180#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36181#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:53,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {36181#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36181#(<= main_~i~0 15)} is VALID [2022-04-15 05:49:53,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {36181#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36182#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:53,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {36182#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36182#(<= main_~i~0 16)} is VALID [2022-04-15 05:49:53,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {36182#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36183#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:53,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {36183#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36183#(<= main_~i~0 17)} is VALID [2022-04-15 05:49:53,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {36183#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36184#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:53,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {36184#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36184#(<= main_~i~0 18)} is VALID [2022-04-15 05:49:53,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {36184#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36185#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:53,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {36185#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36185#(<= main_~i~0 19)} is VALID [2022-04-15 05:49:53,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {36185#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36186#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:53,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {36186#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36186#(<= main_~i~0 20)} is VALID [2022-04-15 05:49:53,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {36186#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36187#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:53,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {36187#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36187#(<= main_~i~0 21)} is VALID [2022-04-15 05:49:53,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {36187#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36188#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:53,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {36188#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36188#(<= main_~i~0 22)} is VALID [2022-04-15 05:49:53,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {36188#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36189#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:53,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {36189#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36189#(<= main_~i~0 23)} is VALID [2022-04-15 05:49:53,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {36189#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36190#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:53,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {36190#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36190#(<= main_~i~0 24)} is VALID [2022-04-15 05:49:53,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {36190#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36191#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:53,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {36191#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36191#(<= main_~i~0 25)} is VALID [2022-04-15 05:49:53,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {36191#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36192#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:53,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {36192#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36192#(<= main_~i~0 26)} is VALID [2022-04-15 05:49:53,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {36192#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36193#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:53,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {36193#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36193#(<= main_~i~0 27)} is VALID [2022-04-15 05:49:53,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {36193#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36194#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:53,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {36194#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36194#(<= main_~i~0 28)} is VALID [2022-04-15 05:49:53,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {36194#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36195#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:53,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {36195#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36195#(<= main_~i~0 29)} is VALID [2022-04-15 05:49:53,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {36195#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36196#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:53,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {36196#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36196#(<= main_~i~0 30)} is VALID [2022-04-15 05:49:53,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {36196#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36197#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:53,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {36197#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36197#(<= main_~i~0 31)} is VALID [2022-04-15 05:49:53,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {36197#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36198#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:53,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {36198#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36198#(<= main_~i~0 32)} is VALID [2022-04-15 05:49:53,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {36198#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36199#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:53,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {36199#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36199#(<= main_~i~0 33)} is VALID [2022-04-15 05:49:53,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {36199#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36200#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:53,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {36200#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36200#(<= main_~i~0 34)} is VALID [2022-04-15 05:49:53,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {36200#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36201#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:53,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {36201#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36201#(<= main_~i~0 35)} is VALID [2022-04-15 05:49:53,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {36201#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36202#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:53,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {36202#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36202#(<= main_~i~0 36)} is VALID [2022-04-15 05:49:53,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {36202#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36203#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:53,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {36203#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36203#(<= main_~i~0 37)} is VALID [2022-04-15 05:49:53,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {36203#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36204#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:53,737 INFO L290 TraceCheckUtils]: 82: Hoare triple {36204#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36204#(<= main_~i~0 38)} is VALID [2022-04-15 05:49:53,737 INFO L290 TraceCheckUtils]: 83: Hoare triple {36204#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36205#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:53,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {36205#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36205#(<= main_~i~0 39)} is VALID [2022-04-15 05:49:53,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {36205#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36206#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:53,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {36206#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36206#(<= main_~i~0 40)} is VALID [2022-04-15 05:49:53,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {36206#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36207#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:53,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {36207#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36207#(<= main_~i~0 41)} is VALID [2022-04-15 05:49:53,739 INFO L290 TraceCheckUtils]: 89: Hoare triple {36207#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36208#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:53,739 INFO L290 TraceCheckUtils]: 90: Hoare triple {36208#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36208#(<= main_~i~0 42)} is VALID [2022-04-15 05:49:53,740 INFO L290 TraceCheckUtils]: 91: Hoare triple {36208#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36209#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:53,740 INFO L290 TraceCheckUtils]: 92: Hoare triple {36209#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36209#(<= main_~i~0 43)} is VALID [2022-04-15 05:49:53,740 INFO L290 TraceCheckUtils]: 93: Hoare triple {36209#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36210#(<= main_~i~0 44)} is VALID [2022-04-15 05:49:53,740 INFO L290 TraceCheckUtils]: 94: Hoare triple {36210#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36210#(<= main_~i~0 44)} is VALID [2022-04-15 05:49:53,741 INFO L290 TraceCheckUtils]: 95: Hoare triple {36210#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36211#(<= main_~i~0 45)} is VALID [2022-04-15 05:49:53,741 INFO L290 TraceCheckUtils]: 96: Hoare triple {36211#(<= main_~i~0 45)} assume !(~i~0 < 1024); {36162#false} is VALID [2022-04-15 05:49:53,741 INFO L290 TraceCheckUtils]: 97: Hoare triple {36162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {36162#false} is VALID [2022-04-15 05:49:53,741 INFO L272 TraceCheckUtils]: 98: Hoare triple {36162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {36162#false} is VALID [2022-04-15 05:49:53,741 INFO L290 TraceCheckUtils]: 99: Hoare triple {36162#false} ~cond := #in~cond; {36162#false} is VALID [2022-04-15 05:49:53,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {36162#false} assume 0 == ~cond; {36162#false} is VALID [2022-04-15 05:49:53,741 INFO L290 TraceCheckUtils]: 101: Hoare triple {36162#false} assume !false; {36162#false} is VALID [2022-04-15 05:49:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:49:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:49:53,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529957977] [2022-04-15 05:49:53,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529957977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:49:53,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084647040] [2022-04-15 05:49:53,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:49:53,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:49:53,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:49:53,745 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:49:53,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 05:55:10,065 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2022-04-15 05:55:10,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:10,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 05:55:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:10,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:10,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {36161#true} call ULTIMATE.init(); {36161#true} is VALID [2022-04-15 05:55:10,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {36161#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(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-15 05:55:10,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-15 05:55:10,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-15 05:55:10,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {36161#true} call #t~ret6 := main(); {36161#true} is VALID [2022-04-15 05:55:10,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {36161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {36231#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:10,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {36231#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36231#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:10,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {36231#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36167#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:10,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {36167#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36167#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:10,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {36167#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36168#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:10,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {36168#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36168#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:10,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {36168#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36169#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:10,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {36169#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36169#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:10,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {36169#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36170#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:10,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {36170#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36170#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:10,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {36170#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36171#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:10,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {36171#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36171#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:10,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {36171#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36172#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:10,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {36172#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36172#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:10,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {36172#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36173#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:10,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {36173#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36173#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:10,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {36173#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36174#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:10,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {36174#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36174#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:10,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {36174#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36175#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:10,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {36175#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36175#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:10,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {36175#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36176#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:10,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {36176#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36176#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:10,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {36176#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36177#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:10,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {36177#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36177#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:10,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {36177#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36178#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:10,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {36178#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36178#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:10,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {36178#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36179#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:10,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {36179#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36179#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:10,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {36179#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36180#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:10,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {36180#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36180#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:10,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {36180#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36181#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:10,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {36181#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36181#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:10,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {36181#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36182#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:10,942 INFO L290 TraceCheckUtils]: 38: Hoare triple {36182#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36182#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:10,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {36182#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36183#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:10,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {36183#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36183#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:10,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {36183#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36184#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:10,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {36184#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36184#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:10,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {36184#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36185#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:10,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {36185#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36185#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:10,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {36185#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36186#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:10,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {36186#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36186#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:10,944 INFO L290 TraceCheckUtils]: 47: Hoare triple {36186#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36187#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:10,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {36187#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36187#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:10,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {36187#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36188#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:10,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {36188#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36188#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:10,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {36188#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36189#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:10,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {36189#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36189#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:10,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {36189#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36190#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:10,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {36190#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36190#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:10,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {36190#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36191#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:10,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {36191#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36191#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:10,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {36191#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36192#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:10,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {36192#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36192#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:10,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {36192#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36193#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:10,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {36193#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36193#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:10,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {36193#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36194#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:10,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {36194#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36194#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:10,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {36194#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36195#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:10,950 INFO L290 TraceCheckUtils]: 64: Hoare triple {36195#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36195#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:10,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {36195#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36196#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:10,950 INFO L290 TraceCheckUtils]: 66: Hoare triple {36196#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36196#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:10,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {36196#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36197#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:10,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {36197#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36197#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:10,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {36197#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36198#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:10,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {36198#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36198#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:10,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {36198#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36199#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:10,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {36199#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36199#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:10,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {36199#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36200#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:10,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {36200#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36200#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:10,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {36200#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36201#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:10,953 INFO L290 TraceCheckUtils]: 76: Hoare triple {36201#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36201#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:10,954 INFO L290 TraceCheckUtils]: 77: Hoare triple {36201#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36202#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:10,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {36202#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36202#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:10,954 INFO L290 TraceCheckUtils]: 79: Hoare triple {36202#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36203#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:10,955 INFO L290 TraceCheckUtils]: 80: Hoare triple {36203#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36203#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:10,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {36203#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36204#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:10,955 INFO L290 TraceCheckUtils]: 82: Hoare triple {36204#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36204#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:10,956 INFO L290 TraceCheckUtils]: 83: Hoare triple {36204#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36205#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:10,956 INFO L290 TraceCheckUtils]: 84: Hoare triple {36205#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36205#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:10,956 INFO L290 TraceCheckUtils]: 85: Hoare triple {36205#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36206#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:10,957 INFO L290 TraceCheckUtils]: 86: Hoare triple {36206#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36206#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:10,957 INFO L290 TraceCheckUtils]: 87: Hoare triple {36206#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36207#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:10,957 INFO L290 TraceCheckUtils]: 88: Hoare triple {36207#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36207#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:10,958 INFO L290 TraceCheckUtils]: 89: Hoare triple {36207#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36208#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:10,958 INFO L290 TraceCheckUtils]: 90: Hoare triple {36208#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36208#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:10,958 INFO L290 TraceCheckUtils]: 91: Hoare triple {36208#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36209#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:10,959 INFO L290 TraceCheckUtils]: 92: Hoare triple {36209#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36209#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:10,959 INFO L290 TraceCheckUtils]: 93: Hoare triple {36209#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36210#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:10,959 INFO L290 TraceCheckUtils]: 94: Hoare triple {36210#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36210#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:10,960 INFO L290 TraceCheckUtils]: 95: Hoare triple {36210#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36211#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:10,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {36211#(<= main_~i~0 45)} assume !(~i~0 < 1024); {36162#false} is VALID [2022-04-15 05:55:10,960 INFO L290 TraceCheckUtils]: 97: Hoare triple {36162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {36162#false} is VALID [2022-04-15 05:55:10,960 INFO L272 TraceCheckUtils]: 98: Hoare triple {36162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {36162#false} is VALID [2022-04-15 05:55:10,960 INFO L290 TraceCheckUtils]: 99: Hoare triple {36162#false} ~cond := #in~cond; {36162#false} is VALID [2022-04-15 05:55:10,960 INFO L290 TraceCheckUtils]: 100: Hoare triple {36162#false} assume 0 == ~cond; {36162#false} is VALID [2022-04-15 05:55:10,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {36162#false} assume !false; {36162#false} is VALID [2022-04-15 05:55:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:10,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:13,605 INFO L290 TraceCheckUtils]: 101: Hoare triple {36162#false} assume !false; {36162#false} is VALID [2022-04-15 05:55:13,605 INFO L290 TraceCheckUtils]: 100: Hoare triple {36162#false} assume 0 == ~cond; {36162#false} is VALID [2022-04-15 05:55:13,605 INFO L290 TraceCheckUtils]: 99: Hoare triple {36162#false} ~cond := #in~cond; {36162#false} is VALID [2022-04-15 05:55:13,605 INFO L272 TraceCheckUtils]: 98: Hoare triple {36162#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {36162#false} is VALID [2022-04-15 05:55:13,605 INFO L290 TraceCheckUtils]: 97: Hoare triple {36162#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {36162#false} is VALID [2022-04-15 05:55:13,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {36535#(< main_~i~0 1024)} assume !(~i~0 < 1024); {36162#false} is VALID [2022-04-15 05:55:13,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {36539#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36535#(< main_~i~0 1024)} is VALID [2022-04-15 05:55:13,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {36539#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36539#(< main_~i~0 1023)} is VALID [2022-04-15 05:55:13,607 INFO L290 TraceCheckUtils]: 93: Hoare triple {36546#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36539#(< main_~i~0 1023)} is VALID [2022-04-15 05:55:13,607 INFO L290 TraceCheckUtils]: 92: Hoare triple {36546#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36546#(< main_~i~0 1022)} is VALID [2022-04-15 05:55:13,607 INFO L290 TraceCheckUtils]: 91: Hoare triple {36553#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36546#(< main_~i~0 1022)} is VALID [2022-04-15 05:55:13,607 INFO L290 TraceCheckUtils]: 90: Hoare triple {36553#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36553#(< main_~i~0 1021)} is VALID [2022-04-15 05:55:13,608 INFO L290 TraceCheckUtils]: 89: Hoare triple {36560#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36553#(< main_~i~0 1021)} is VALID [2022-04-15 05:55:13,608 INFO L290 TraceCheckUtils]: 88: Hoare triple {36560#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36560#(< main_~i~0 1020)} is VALID [2022-04-15 05:55:13,608 INFO L290 TraceCheckUtils]: 87: Hoare triple {36567#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36560#(< main_~i~0 1020)} is VALID [2022-04-15 05:55:13,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {36567#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36567#(< main_~i~0 1019)} is VALID [2022-04-15 05:55:13,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {36574#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36567#(< main_~i~0 1019)} is VALID [2022-04-15 05:55:13,609 INFO L290 TraceCheckUtils]: 84: Hoare triple {36574#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36574#(< main_~i~0 1018)} is VALID [2022-04-15 05:55:13,610 INFO L290 TraceCheckUtils]: 83: Hoare triple {36581#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36574#(< main_~i~0 1018)} is VALID [2022-04-15 05:55:13,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {36581#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36581#(< main_~i~0 1017)} is VALID [2022-04-15 05:55:13,610 INFO L290 TraceCheckUtils]: 81: Hoare triple {36588#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36581#(< main_~i~0 1017)} is VALID [2022-04-15 05:55:13,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {36588#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36588#(< main_~i~0 1016)} is VALID [2022-04-15 05:55:13,611 INFO L290 TraceCheckUtils]: 79: Hoare triple {36595#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36588#(< main_~i~0 1016)} is VALID [2022-04-15 05:55:13,611 INFO L290 TraceCheckUtils]: 78: Hoare triple {36595#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36595#(< main_~i~0 1015)} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {36602#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36595#(< main_~i~0 1015)} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {36602#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36602#(< main_~i~0 1014)} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {36609#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36602#(< main_~i~0 1014)} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {36609#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36609#(< main_~i~0 1013)} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {36616#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36609#(< main_~i~0 1013)} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {36616#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36616#(< main_~i~0 1012)} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {36623#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36616#(< main_~i~0 1012)} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 70: Hoare triple {36623#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36623#(< main_~i~0 1011)} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 69: Hoare triple {36630#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36623#(< main_~i~0 1011)} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {36630#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36630#(< main_~i~0 1010)} is VALID [2022-04-15 05:55:13,615 INFO L290 TraceCheckUtils]: 67: Hoare triple {36637#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36630#(< main_~i~0 1010)} is VALID [2022-04-15 05:55:13,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {36637#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36637#(< main_~i~0 1009)} is VALID [2022-04-15 05:55:13,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {36644#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36637#(< main_~i~0 1009)} is VALID [2022-04-15 05:55:13,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {36644#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36644#(< main_~i~0 1008)} is VALID [2022-04-15 05:55:13,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {36651#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36644#(< main_~i~0 1008)} is VALID [2022-04-15 05:55:13,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {36651#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36651#(< main_~i~0 1007)} is VALID [2022-04-15 05:55:13,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {36658#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36651#(< main_~i~0 1007)} is VALID [2022-04-15 05:55:13,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {36658#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36658#(< main_~i~0 1006)} is VALID [2022-04-15 05:55:13,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {36665#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36658#(< main_~i~0 1006)} is VALID [2022-04-15 05:55:13,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {36665#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36665#(< main_~i~0 1005)} is VALID [2022-04-15 05:55:13,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {36672#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36665#(< main_~i~0 1005)} is VALID [2022-04-15 05:55:13,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {36672#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36672#(< main_~i~0 1004)} is VALID [2022-04-15 05:55:13,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {36679#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36672#(< main_~i~0 1004)} is VALID [2022-04-15 05:55:13,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {36679#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36679#(< main_~i~0 1003)} is VALID [2022-04-15 05:55:13,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {36686#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36679#(< main_~i~0 1003)} is VALID [2022-04-15 05:55:13,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {36686#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36686#(< main_~i~0 1002)} is VALID [2022-04-15 05:55:13,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {36693#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36686#(< main_~i~0 1002)} is VALID [2022-04-15 05:55:13,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {36693#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36693#(< main_~i~0 1001)} is VALID [2022-04-15 05:55:13,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {36700#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36693#(< main_~i~0 1001)} is VALID [2022-04-15 05:55:13,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {36700#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36700#(< main_~i~0 1000)} is VALID [2022-04-15 05:55:13,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {36707#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36700#(< main_~i~0 1000)} is VALID [2022-04-15 05:55:13,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {36707#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36707#(< main_~i~0 999)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {36714#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36707#(< main_~i~0 999)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {36714#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36714#(< main_~i~0 998)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {36721#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36714#(< main_~i~0 998)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {36721#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36721#(< main_~i~0 997)} is VALID [2022-04-15 05:55:13,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {36728#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36721#(< main_~i~0 997)} is VALID [2022-04-15 05:55:13,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {36728#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36728#(< main_~i~0 996)} is VALID [2022-04-15 05:55:13,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {36735#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36728#(< main_~i~0 996)} is VALID [2022-04-15 05:55:13,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {36735#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36735#(< main_~i~0 995)} is VALID [2022-04-15 05:55:13,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {36742#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36735#(< main_~i~0 995)} is VALID [2022-04-15 05:55:13,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {36742#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36742#(< main_~i~0 994)} is VALID [2022-04-15 05:55:13,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {36749#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36742#(< main_~i~0 994)} is VALID [2022-04-15 05:55:13,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {36749#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36749#(< main_~i~0 993)} is VALID [2022-04-15 05:55:13,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {36756#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36749#(< main_~i~0 993)} is VALID [2022-04-15 05:55:13,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {36756#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36756#(< main_~i~0 992)} is VALID [2022-04-15 05:55:13,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {36763#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36756#(< main_~i~0 992)} is VALID [2022-04-15 05:55:13,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {36763#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36763#(< main_~i~0 991)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {36770#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36763#(< main_~i~0 991)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {36770#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36770#(< main_~i~0 990)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {36777#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36770#(< main_~i~0 990)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {36777#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36777#(< main_~i~0 989)} is VALID [2022-04-15 05:55:13,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {36784#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36777#(< main_~i~0 989)} is VALID [2022-04-15 05:55:13,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {36784#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36784#(< main_~i~0 988)} is VALID [2022-04-15 05:55:13,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {36791#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36784#(< main_~i~0 988)} is VALID [2022-04-15 05:55:13,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {36791#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36791#(< main_~i~0 987)} is VALID [2022-04-15 05:55:13,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {36798#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36791#(< main_~i~0 987)} is VALID [2022-04-15 05:55:13,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {36798#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36798#(< main_~i~0 986)} is VALID [2022-04-15 05:55:13,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {36805#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36798#(< main_~i~0 986)} is VALID [2022-04-15 05:55:13,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {36805#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36805#(< main_~i~0 985)} is VALID [2022-04-15 05:55:13,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {36812#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36805#(< main_~i~0 985)} is VALID [2022-04-15 05:55:13,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {36812#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36812#(< main_~i~0 984)} is VALID [2022-04-15 05:55:13,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {36819#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36812#(< main_~i~0 984)} is VALID [2022-04-15 05:55:13,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {36819#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36819#(< main_~i~0 983)} is VALID [2022-04-15 05:55:13,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {36826#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36819#(< main_~i~0 983)} is VALID [2022-04-15 05:55:13,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {36826#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36826#(< main_~i~0 982)} is VALID [2022-04-15 05:55:13,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {36833#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36826#(< main_~i~0 982)} is VALID [2022-04-15 05:55:13,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {36833#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36833#(< main_~i~0 981)} is VALID [2022-04-15 05:55:13,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {36840#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36833#(< main_~i~0 981)} is VALID [2022-04-15 05:55:13,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {36840#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36840#(< main_~i~0 980)} is VALID [2022-04-15 05:55:13,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {36847#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {36840#(< main_~i~0 980)} is VALID [2022-04-15 05:55:13,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {36847#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36847#(< main_~i~0 979)} is VALID [2022-04-15 05:55:13,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {36161#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {36847#(< main_~i~0 979)} is VALID [2022-04-15 05:55:13,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {36161#true} call #t~ret6 := main(); {36161#true} is VALID [2022-04-15 05:55:13,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36161#true} {36161#true} #39#return; {36161#true} is VALID [2022-04-15 05:55:13,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {36161#true} assume true; {36161#true} is VALID [2022-04-15 05:55:13,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {36161#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(12, 2);call #Ultimate.allocInit(12, 3); {36161#true} is VALID [2022-04-15 05:55:13,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {36161#true} call ULTIMATE.init(); {36161#true} is VALID [2022-04-15 05:55:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:13,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084647040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:13,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:13,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 05:55:13,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:13,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [471058765] [2022-04-15 05:55:13,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [471058765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:13,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:13,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 05:55:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141038480] [2022-04-15 05:55:13,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:13,636 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 05:55:13,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:13,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:13,699 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-15 05:55:13,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 05:55:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 05:55:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 05:55:13,700 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:15,317 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-15 05:55:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 05:55:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 05:55:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-15 05:55:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-15 05:55:15,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 112 transitions. [2022-04-15 05:55:15,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:15,423 INFO L225 Difference]: With dead ends: 112 [2022-04-15 05:55:15,423 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 05:55:15,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 05:55:15,425 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:55:15,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 44 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:55:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 05:55:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-04-15 05:55:15,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:15,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:15,997 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:15,997 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:15,998 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-15 05:55:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-15 05:55:15,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:15,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:15,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 05:55:15,999 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 05:55:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:16,000 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-15 05:55:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-15 05:55:16,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:16,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:16,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:16,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-04-15 05:55:16,002 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2022-04-15 05:55:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:16,002 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-04-15 05:55:16,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:16,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 105 transitions. [2022-04-15 05:55:16,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-15 05:55:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 05:55:16,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:16,159 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:16,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-15 05:55:16,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-15 05:55:16,375 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -609408938, now seen corresponding path program 91 times [2022-04-15 05:55:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:16,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292619549] [2022-04-15 05:55:16,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:16,378 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:16,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -609408938, now seen corresponding path program 92 times [2022-04-15 05:55:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:16,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066792257] [2022-04-15 05:55:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:17,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {37661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {37609#true} call ULTIMATE.init(); {37661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:17,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {37661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {37609#true} call #t~ret6 := main(); {37609#true} is VALID [2022-04-15 05:55:17,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {37609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {37614#(= main_~i~0 0)} is VALID [2022-04-15 05:55:17,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {37614#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37614#(= main_~i~0 0)} is VALID [2022-04-15 05:55:17,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {37614#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37615#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:17,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {37615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37615#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:17,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {37615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37616#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:17,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {37616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37616#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:17,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {37616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37617#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:17,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {37617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37617#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:17,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {37617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37618#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:17,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {37618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37618#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:17,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {37618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37619#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:17,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {37619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37619#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:17,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {37619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37620#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:17,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {37620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37620#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:17,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {37620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37621#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:17,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {37621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37621#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:17,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {37621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37622#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:17,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {37622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37622#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:17,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {37622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37623#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:17,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {37623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37623#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:17,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {37623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37624#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:17,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {37624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37624#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:17,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {37624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37625#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:17,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {37625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37625#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:17,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {37625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37626#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:17,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {37626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37626#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:17,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {37626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37627#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:17,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {37627#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37627#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:17,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {37627#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37628#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:17,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {37628#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37628#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:17,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {37628#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37629#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:17,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {37629#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37629#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:17,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {37629#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37630#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:17,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {37630#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37630#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:17,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {37630#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37631#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:17,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {37631#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37631#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:17,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {37631#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37632#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:17,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {37632#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37632#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:17,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {37632#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37633#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:17,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {37633#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37633#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:17,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {37633#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37634#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:17,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {37634#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37634#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:17,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {37634#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37635#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:17,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {37635#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37635#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:17,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {37635#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37636#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:17,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {37636#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37636#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:17,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {37636#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37637#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:17,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {37637#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37637#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:17,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {37637#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37638#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:17,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {37638#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37638#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:17,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {37638#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37639#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:17,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {37639#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37639#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:17,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {37639#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37640#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:17,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {37640#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37640#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:17,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {37640#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37641#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:17,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {37641#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37641#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:17,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {37641#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37642#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:17,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {37642#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37642#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:17,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {37642#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37643#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:17,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {37643#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37643#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:17,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {37643#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37644#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:17,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {37644#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37644#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:17,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {37644#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37645#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:17,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {37645#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37645#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:17,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {37645#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37646#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:17,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {37646#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37646#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:17,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {37646#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37647#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:17,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {37647#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37647#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:17,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {37647#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37648#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:17,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {37648#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37648#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:17,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {37648#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37649#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:17,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {37649#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37649#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:17,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {37649#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37650#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:17,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {37650#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37650#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:17,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {37650#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37651#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:17,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {37651#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37651#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:17,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {37651#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37652#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:17,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {37652#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37652#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:17,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {37652#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37653#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:17,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {37653#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37653#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:17,390 INFO L290 TraceCheckUtils]: 85: Hoare triple {37653#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37654#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:17,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {37654#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37654#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:17,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {37654#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37655#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:17,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {37655#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37655#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:17,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {37655#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37656#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:17,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {37656#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37656#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:17,392 INFO L290 TraceCheckUtils]: 91: Hoare triple {37656#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37657#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:17,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {37657#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37657#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:17,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {37657#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37658#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:17,393 INFO L290 TraceCheckUtils]: 94: Hoare triple {37658#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37658#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:17,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {37658#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37659#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:17,394 INFO L290 TraceCheckUtils]: 96: Hoare triple {37659#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37659#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:17,394 INFO L290 TraceCheckUtils]: 97: Hoare triple {37659#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37660#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:17,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {37660#(<= main_~i~0 46)} assume !(~i~0 < 1024); {37610#false} is VALID [2022-04-15 05:55:17,394 INFO L290 TraceCheckUtils]: 99: Hoare triple {37610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {37610#false} is VALID [2022-04-15 05:55:17,394 INFO L272 TraceCheckUtils]: 100: Hoare triple {37610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {37610#false} is VALID [2022-04-15 05:55:17,395 INFO L290 TraceCheckUtils]: 101: Hoare triple {37610#false} ~cond := #in~cond; {37610#false} is VALID [2022-04-15 05:55:17,395 INFO L290 TraceCheckUtils]: 102: Hoare triple {37610#false} assume 0 == ~cond; {37610#false} is VALID [2022-04-15 05:55:17,395 INFO L290 TraceCheckUtils]: 103: Hoare triple {37610#false} assume !false; {37610#false} is VALID [2022-04-15 05:55:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:17,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066792257] [2022-04-15 05:55:17,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066792257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:17,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743902038] [2022-04-15 05:55:17,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:55:17,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:17,396 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:55:17,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 05:55:17,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:55:17,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:17,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 05:55:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:17,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:18,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {37609#true} call ULTIMATE.init(); {37609#true} is VALID [2022-04-15 05:55:18,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {37609#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(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-15 05:55:18,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-15 05:55:18,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-15 05:55:18,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {37609#true} call #t~ret6 := main(); {37609#true} is VALID [2022-04-15 05:55:18,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {37609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {37680#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:18,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {37680#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37680#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:18,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {37680#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37615#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:18,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {37615#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37615#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:18,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {37615#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37616#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:18,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {37616#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37616#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:18,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {37616#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37617#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:18,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {37617#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37617#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:18,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {37617#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37618#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:18,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {37618#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37618#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:18,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {37618#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37619#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:18,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {37619#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37619#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:18,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {37619#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37620#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:18,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {37620#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37620#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:18,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {37620#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37621#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:18,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {37621#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37621#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:18,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {37621#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37622#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:18,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {37622#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37622#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:18,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {37622#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37623#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:18,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {37623#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37623#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:18,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {37623#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37624#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:18,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {37624#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37624#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:18,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {37624#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37625#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:18,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {37625#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37625#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:18,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {37625#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37626#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:18,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {37626#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37626#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:18,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {37626#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37627#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:18,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {37627#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37627#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:18,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {37627#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37628#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:18,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {37628#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37628#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:18,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {37628#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37629#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:18,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {37629#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37629#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:18,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {37629#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37630#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:18,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {37630#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37630#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:18,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {37630#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37631#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:18,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {37631#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37631#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:18,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {37631#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37632#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:18,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {37632#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37632#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:18,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {37632#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37633#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:18,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {37633#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37633#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:18,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {37633#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37634#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:18,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {37634#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37634#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:18,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {37634#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37635#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:18,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {37635#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37635#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:18,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {37635#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37636#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:18,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {37636#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37636#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:18,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {37636#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37637#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:18,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {37637#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37637#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:18,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {37637#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37638#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:18,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {37638#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37638#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:18,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {37638#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37639#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:18,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {37639#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37639#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:18,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {37639#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37640#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:18,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {37640#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37640#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:18,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {37640#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37641#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:18,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {37641#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37641#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:18,245 INFO L290 TraceCheckUtils]: 61: Hoare triple {37641#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37642#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:18,245 INFO L290 TraceCheckUtils]: 62: Hoare triple {37642#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37642#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:18,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {37642#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37643#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:18,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {37643#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37643#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:18,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {37643#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37644#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:18,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {37644#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37644#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:18,247 INFO L290 TraceCheckUtils]: 67: Hoare triple {37644#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37645#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:18,247 INFO L290 TraceCheckUtils]: 68: Hoare triple {37645#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37645#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:18,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {37645#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37646#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:18,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {37646#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37646#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:18,248 INFO L290 TraceCheckUtils]: 71: Hoare triple {37646#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37647#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:18,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {37647#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37647#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:18,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {37647#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37648#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:18,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {37648#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37648#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:18,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {37648#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37649#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:18,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {37649#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37649#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:18,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {37649#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37650#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:18,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {37650#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37650#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:18,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {37650#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37651#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:18,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {37651#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37651#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:18,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {37651#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37652#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:18,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {37652#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37652#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:18,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {37652#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37653#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:18,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {37653#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37653#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:18,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {37653#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37654#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:18,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {37654#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37654#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:18,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {37654#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37655#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:18,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {37655#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37655#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:18,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {37655#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37656#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:18,254 INFO L290 TraceCheckUtils]: 90: Hoare triple {37656#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37656#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:18,254 INFO L290 TraceCheckUtils]: 91: Hoare triple {37656#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37657#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:18,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {37657#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37657#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:18,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {37657#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37658#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:18,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {37658#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37658#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:18,256 INFO L290 TraceCheckUtils]: 95: Hoare triple {37658#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37659#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:18,256 INFO L290 TraceCheckUtils]: 96: Hoare triple {37659#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37659#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:18,256 INFO L290 TraceCheckUtils]: 97: Hoare triple {37659#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37660#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:18,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {37660#(<= main_~i~0 46)} assume !(~i~0 < 1024); {37610#false} is VALID [2022-04-15 05:55:18,263 INFO L290 TraceCheckUtils]: 99: Hoare triple {37610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {37610#false} is VALID [2022-04-15 05:55:18,264 INFO L272 TraceCheckUtils]: 100: Hoare triple {37610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {37610#false} is VALID [2022-04-15 05:55:18,264 INFO L290 TraceCheckUtils]: 101: Hoare triple {37610#false} ~cond := #in~cond; {37610#false} is VALID [2022-04-15 05:55:18,264 INFO L290 TraceCheckUtils]: 102: Hoare triple {37610#false} assume 0 == ~cond; {37610#false} is VALID [2022-04-15 05:55:18,264 INFO L290 TraceCheckUtils]: 103: Hoare triple {37610#false} assume !false; {37610#false} is VALID [2022-04-15 05:55:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:18,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:21,017 INFO L290 TraceCheckUtils]: 103: Hoare triple {37610#false} assume !false; {37610#false} is VALID [2022-04-15 05:55:21,017 INFO L290 TraceCheckUtils]: 102: Hoare triple {37610#false} assume 0 == ~cond; {37610#false} is VALID [2022-04-15 05:55:21,018 INFO L290 TraceCheckUtils]: 101: Hoare triple {37610#false} ~cond := #in~cond; {37610#false} is VALID [2022-04-15 05:55:21,018 INFO L272 TraceCheckUtils]: 100: Hoare triple {37610#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {37610#false} is VALID [2022-04-15 05:55:21,018 INFO L290 TraceCheckUtils]: 99: Hoare triple {37610#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {37610#false} is VALID [2022-04-15 05:55:21,018 INFO L290 TraceCheckUtils]: 98: Hoare triple {37990#(< main_~i~0 1024)} assume !(~i~0 < 1024); {37610#false} is VALID [2022-04-15 05:55:21,018 INFO L290 TraceCheckUtils]: 97: Hoare triple {37994#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37990#(< main_~i~0 1024)} is VALID [2022-04-15 05:55:21,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {37994#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37994#(< main_~i~0 1023)} is VALID [2022-04-15 05:55:21,019 INFO L290 TraceCheckUtils]: 95: Hoare triple {38001#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {37994#(< main_~i~0 1023)} is VALID [2022-04-15 05:55:21,019 INFO L290 TraceCheckUtils]: 94: Hoare triple {38001#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38001#(< main_~i~0 1022)} is VALID [2022-04-15 05:55:21,020 INFO L290 TraceCheckUtils]: 93: Hoare triple {38008#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38001#(< main_~i~0 1022)} is VALID [2022-04-15 05:55:21,020 INFO L290 TraceCheckUtils]: 92: Hoare triple {38008#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38008#(< main_~i~0 1021)} is VALID [2022-04-15 05:55:21,021 INFO L290 TraceCheckUtils]: 91: Hoare triple {38015#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38008#(< main_~i~0 1021)} is VALID [2022-04-15 05:55:21,021 INFO L290 TraceCheckUtils]: 90: Hoare triple {38015#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38015#(< main_~i~0 1020)} is VALID [2022-04-15 05:55:21,021 INFO L290 TraceCheckUtils]: 89: Hoare triple {38022#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38015#(< main_~i~0 1020)} is VALID [2022-04-15 05:55:21,022 INFO L290 TraceCheckUtils]: 88: Hoare triple {38022#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38022#(< main_~i~0 1019)} is VALID [2022-04-15 05:55:21,022 INFO L290 TraceCheckUtils]: 87: Hoare triple {38029#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38022#(< main_~i~0 1019)} is VALID [2022-04-15 05:55:21,022 INFO L290 TraceCheckUtils]: 86: Hoare triple {38029#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38029#(< main_~i~0 1018)} is VALID [2022-04-15 05:55:21,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {38036#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38029#(< main_~i~0 1018)} is VALID [2022-04-15 05:55:21,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {38036#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38036#(< main_~i~0 1017)} is VALID [2022-04-15 05:55:21,023 INFO L290 TraceCheckUtils]: 83: Hoare triple {38043#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38036#(< main_~i~0 1017)} is VALID [2022-04-15 05:55:21,024 INFO L290 TraceCheckUtils]: 82: Hoare triple {38043#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38043#(< main_~i~0 1016)} is VALID [2022-04-15 05:55:21,024 INFO L290 TraceCheckUtils]: 81: Hoare triple {38050#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38043#(< main_~i~0 1016)} is VALID [2022-04-15 05:55:21,024 INFO L290 TraceCheckUtils]: 80: Hoare triple {38050#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38050#(< main_~i~0 1015)} is VALID [2022-04-15 05:55:21,025 INFO L290 TraceCheckUtils]: 79: Hoare triple {38057#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38050#(< main_~i~0 1015)} is VALID [2022-04-15 05:55:21,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {38057#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38057#(< main_~i~0 1014)} is VALID [2022-04-15 05:55:21,025 INFO L290 TraceCheckUtils]: 77: Hoare triple {38064#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38057#(< main_~i~0 1014)} is VALID [2022-04-15 05:55:21,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {38064#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38064#(< main_~i~0 1013)} is VALID [2022-04-15 05:55:21,026 INFO L290 TraceCheckUtils]: 75: Hoare triple {38071#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38064#(< main_~i~0 1013)} is VALID [2022-04-15 05:55:21,026 INFO L290 TraceCheckUtils]: 74: Hoare triple {38071#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38071#(< main_~i~0 1012)} is VALID [2022-04-15 05:55:21,027 INFO L290 TraceCheckUtils]: 73: Hoare triple {38078#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38071#(< main_~i~0 1012)} is VALID [2022-04-15 05:55:21,027 INFO L290 TraceCheckUtils]: 72: Hoare triple {38078#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38078#(< main_~i~0 1011)} is VALID [2022-04-15 05:55:21,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {38085#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38078#(< main_~i~0 1011)} is VALID [2022-04-15 05:55:21,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {38085#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38085#(< main_~i~0 1010)} is VALID [2022-04-15 05:55:21,028 INFO L290 TraceCheckUtils]: 69: Hoare triple {38092#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38085#(< main_~i~0 1010)} is VALID [2022-04-15 05:55:21,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {38092#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38092#(< main_~i~0 1009)} is VALID [2022-04-15 05:55:21,029 INFO L290 TraceCheckUtils]: 67: Hoare triple {38099#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38092#(< main_~i~0 1009)} is VALID [2022-04-15 05:55:21,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {38099#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38099#(< main_~i~0 1008)} is VALID [2022-04-15 05:55:21,030 INFO L290 TraceCheckUtils]: 65: Hoare triple {38106#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38099#(< main_~i~0 1008)} is VALID [2022-04-15 05:55:21,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {38106#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38106#(< main_~i~0 1007)} is VALID [2022-04-15 05:55:21,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {38113#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38106#(< main_~i~0 1007)} is VALID [2022-04-15 05:55:21,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {38113#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38113#(< main_~i~0 1006)} is VALID [2022-04-15 05:55:21,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {38120#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38113#(< main_~i~0 1006)} is VALID [2022-04-15 05:55:21,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {38120#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38120#(< main_~i~0 1005)} is VALID [2022-04-15 05:55:21,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {38127#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38120#(< main_~i~0 1005)} is VALID [2022-04-15 05:55:21,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {38127#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38127#(< main_~i~0 1004)} is VALID [2022-04-15 05:55:21,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {38134#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38127#(< main_~i~0 1004)} is VALID [2022-04-15 05:55:21,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {38134#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38134#(< main_~i~0 1003)} is VALID [2022-04-15 05:55:21,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {38141#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38134#(< main_~i~0 1003)} is VALID [2022-04-15 05:55:21,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {38141#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38141#(< main_~i~0 1002)} is VALID [2022-04-15 05:55:21,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {38148#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38141#(< main_~i~0 1002)} is VALID [2022-04-15 05:55:21,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {38148#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38148#(< main_~i~0 1001)} is VALID [2022-04-15 05:55:21,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {38155#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38148#(< main_~i~0 1001)} is VALID [2022-04-15 05:55:21,035 INFO L290 TraceCheckUtils]: 50: Hoare triple {38155#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38155#(< main_~i~0 1000)} is VALID [2022-04-15 05:55:21,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {38162#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38155#(< main_~i~0 1000)} is VALID [2022-04-15 05:55:21,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {38162#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38162#(< main_~i~0 999)} is VALID [2022-04-15 05:55:21,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {38169#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38162#(< main_~i~0 999)} is VALID [2022-04-15 05:55:21,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {38169#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38169#(< main_~i~0 998)} is VALID [2022-04-15 05:55:21,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {38176#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38169#(< main_~i~0 998)} is VALID [2022-04-15 05:55:21,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {38176#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38176#(< main_~i~0 997)} is VALID [2022-04-15 05:55:21,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {38183#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38176#(< main_~i~0 997)} is VALID [2022-04-15 05:55:21,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {38183#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38183#(< main_~i~0 996)} is VALID [2022-04-15 05:55:21,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {38190#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38183#(< main_~i~0 996)} is VALID [2022-04-15 05:55:21,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {38190#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38190#(< main_~i~0 995)} is VALID [2022-04-15 05:55:21,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {38197#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38190#(< main_~i~0 995)} is VALID [2022-04-15 05:55:21,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {38197#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38197#(< main_~i~0 994)} is VALID [2022-04-15 05:55:21,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {38204#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38197#(< main_~i~0 994)} is VALID [2022-04-15 05:55:21,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {38204#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38204#(< main_~i~0 993)} is VALID [2022-04-15 05:55:21,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {38211#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38204#(< main_~i~0 993)} is VALID [2022-04-15 05:55:21,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {38211#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38211#(< main_~i~0 992)} is VALID [2022-04-15 05:55:21,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {38218#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38211#(< main_~i~0 992)} is VALID [2022-04-15 05:55:21,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {38218#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38218#(< main_~i~0 991)} is VALID [2022-04-15 05:55:21,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {38225#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38218#(< main_~i~0 991)} is VALID [2022-04-15 05:55:21,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {38225#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38225#(< main_~i~0 990)} is VALID [2022-04-15 05:55:21,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {38232#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38225#(< main_~i~0 990)} is VALID [2022-04-15 05:55:21,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {38232#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38232#(< main_~i~0 989)} is VALID [2022-04-15 05:55:21,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {38239#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38232#(< main_~i~0 989)} is VALID [2022-04-15 05:55:21,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {38239#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38239#(< main_~i~0 988)} is VALID [2022-04-15 05:55:21,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {38246#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38239#(< main_~i~0 988)} is VALID [2022-04-15 05:55:21,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {38246#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38246#(< main_~i~0 987)} is VALID [2022-04-15 05:55:21,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {38253#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38246#(< main_~i~0 987)} is VALID [2022-04-15 05:55:21,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {38253#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38253#(< main_~i~0 986)} is VALID [2022-04-15 05:55:21,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {38260#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38253#(< main_~i~0 986)} is VALID [2022-04-15 05:55:21,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {38260#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38260#(< main_~i~0 985)} is VALID [2022-04-15 05:55:21,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {38267#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38260#(< main_~i~0 985)} is VALID [2022-04-15 05:55:21,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {38267#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38267#(< main_~i~0 984)} is VALID [2022-04-15 05:55:21,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {38274#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38267#(< main_~i~0 984)} is VALID [2022-04-15 05:55:21,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {38274#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38274#(< main_~i~0 983)} is VALID [2022-04-15 05:55:21,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {38281#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38274#(< main_~i~0 983)} is VALID [2022-04-15 05:55:21,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {38281#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38281#(< main_~i~0 982)} is VALID [2022-04-15 05:55:21,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {38288#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38281#(< main_~i~0 982)} is VALID [2022-04-15 05:55:21,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {38288#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38288#(< main_~i~0 981)} is VALID [2022-04-15 05:55:21,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {38295#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38288#(< main_~i~0 981)} is VALID [2022-04-15 05:55:21,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {38295#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38295#(< main_~i~0 980)} is VALID [2022-04-15 05:55:21,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {38302#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38295#(< main_~i~0 980)} is VALID [2022-04-15 05:55:21,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {38302#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38302#(< main_~i~0 979)} is VALID [2022-04-15 05:55:21,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {38309#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {38302#(< main_~i~0 979)} is VALID [2022-04-15 05:55:21,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {38309#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38309#(< main_~i~0 978)} is VALID [2022-04-15 05:55:21,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {37609#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {38309#(< main_~i~0 978)} is VALID [2022-04-15 05:55:21,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {37609#true} call #t~ret6 := main(); {37609#true} is VALID [2022-04-15 05:55:21,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37609#true} {37609#true} #39#return; {37609#true} is VALID [2022-04-15 05:55:21,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {37609#true} assume true; {37609#true} is VALID [2022-04-15 05:55:21,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {37609#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(12, 2);call #Ultimate.allocInit(12, 3); {37609#true} is VALID [2022-04-15 05:55:21,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {37609#true} call ULTIMATE.init(); {37609#true} is VALID [2022-04-15 05:55:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743902038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:21,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 05:55:21,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292619549] [2022-04-15 05:55:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292619549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 05:55:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218996689] [2022-04-15 05:55:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-15 05:55:21,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:21,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:21,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:21,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 05:55:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:21,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 05:55:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 05:55:21,120 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:22,748 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-15 05:55:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 05:55:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-15 05:55:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-15 05:55:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-15 05:55:22,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 114 transitions. [2022-04-15 05:55:22,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:22,833 INFO L225 Difference]: With dead ends: 114 [2022-04-15 05:55:22,833 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 05:55:22,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 05:55:22,835 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:55:22,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 29 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:55:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 05:55:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-15 05:55:23,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:23,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:23,321 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:23,321 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:23,322 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-15 05:55:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-15 05:55:23,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:23,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:23,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-15 05:55:23,323 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-15 05:55:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:23,324 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-15 05:55:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-15 05:55:23,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:23,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:23,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:23,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2022-04-15 05:55:23,325 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2022-04-15 05:55:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:23,326 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2022-04-15 05:55:23,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:23,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 107 transitions. [2022-04-15 05:55:23,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-15 05:55:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 05:55:23,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:23,457 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:23,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-15 05:55:23,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:23,658 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1894442584, now seen corresponding path program 93 times [2022-04-15 05:55:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:23,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751309154] [2022-04-15 05:55:23,662 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:23,662 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:23,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1894442584, now seen corresponding path program 94 times [2022-04-15 05:55:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:23,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775506091] [2022-04-15 05:55:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:24,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {39138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-15 05:55:24,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-15 05:55:24,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-15 05:55:24,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {39085#true} call ULTIMATE.init(); {39138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:24,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {39138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-15 05:55:24,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-15 05:55:24,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-15 05:55:24,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {39085#true} call #t~ret6 := main(); {39085#true} is VALID [2022-04-15 05:55:24,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {39085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {39090#(= main_~i~0 0)} is VALID [2022-04-15 05:55:24,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {39090#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39090#(= main_~i~0 0)} is VALID [2022-04-15 05:55:24,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {39090#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39091#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:24,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {39091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:24,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {39091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39092#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:24,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {39092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:24,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {39092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39093#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:24,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {39093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:24,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {39093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39094#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:24,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {39094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:24,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {39094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39095#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:24,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {39095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:24,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {39095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39096#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:24,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {39096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:24,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {39096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39097#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:24,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {39097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:24,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {39097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39098#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:24,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {39098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:24,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {39098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39099#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:24,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {39099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:24,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {39099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39100#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:24,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {39100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:24,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {39100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39101#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:24,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {39101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:24,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {39101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39102#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:24,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {39102#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:24,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {39102#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39103#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:24,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {39103#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:24,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {39103#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39104#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:24,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {39104#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:24,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {39104#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39105#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:24,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {39105#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:24,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {39105#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39106#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:24,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {39106#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:24,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {39106#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39107#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:24,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {39107#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:24,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {39107#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39108#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:24,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {39108#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:24,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {39108#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39109#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:24,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {39109#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:24,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {39109#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39110#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:24,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {39110#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:24,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {39110#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39111#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:24,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {39111#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:24,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {39111#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39112#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:24,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {39112#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:24,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {39112#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39113#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:24,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {39113#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:24,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {39113#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39114#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:24,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {39114#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:24,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {39114#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39115#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:24,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {39115#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:24,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {39115#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39116#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:24,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {39116#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:24,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {39116#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39117#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:24,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {39117#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:24,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {39117#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39118#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:24,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {39118#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:24,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {39118#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39119#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:24,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {39119#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:24,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {39119#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39120#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:24,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {39120#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:24,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {39120#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39121#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:24,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {39121#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:24,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {39121#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39122#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:24,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {39122#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:24,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {39122#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39123#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:24,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {39123#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:24,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {39123#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39124#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:24,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {39124#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:24,624 INFO L290 TraceCheckUtils]: 75: Hoare triple {39124#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39125#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:24,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {39125#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:24,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {39125#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39126#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:24,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {39126#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:24,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {39126#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39127#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:24,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {39127#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:24,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {39127#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39128#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:24,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {39128#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:24,627 INFO L290 TraceCheckUtils]: 83: Hoare triple {39128#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39129#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:24,627 INFO L290 TraceCheckUtils]: 84: Hoare triple {39129#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:24,627 INFO L290 TraceCheckUtils]: 85: Hoare triple {39129#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39130#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:24,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {39130#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:24,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {39130#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39131#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:24,628 INFO L290 TraceCheckUtils]: 88: Hoare triple {39131#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:24,628 INFO L290 TraceCheckUtils]: 89: Hoare triple {39131#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39132#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:24,629 INFO L290 TraceCheckUtils]: 90: Hoare triple {39132#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39132#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:24,629 INFO L290 TraceCheckUtils]: 91: Hoare triple {39132#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39133#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:24,629 INFO L290 TraceCheckUtils]: 92: Hoare triple {39133#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39133#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:24,630 INFO L290 TraceCheckUtils]: 93: Hoare triple {39133#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39134#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:24,630 INFO L290 TraceCheckUtils]: 94: Hoare triple {39134#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39134#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:24,630 INFO L290 TraceCheckUtils]: 95: Hoare triple {39134#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39135#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:24,631 INFO L290 TraceCheckUtils]: 96: Hoare triple {39135#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39135#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:24,631 INFO L290 TraceCheckUtils]: 97: Hoare triple {39135#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39136#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:24,631 INFO L290 TraceCheckUtils]: 98: Hoare triple {39136#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39136#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:24,631 INFO L290 TraceCheckUtils]: 99: Hoare triple {39136#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39137#(<= main_~i~0 47)} is VALID [2022-04-15 05:55:24,632 INFO L290 TraceCheckUtils]: 100: Hoare triple {39137#(<= main_~i~0 47)} assume !(~i~0 < 1024); {39086#false} is VALID [2022-04-15 05:55:24,632 INFO L290 TraceCheckUtils]: 101: Hoare triple {39086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {39086#false} is VALID [2022-04-15 05:55:24,632 INFO L272 TraceCheckUtils]: 102: Hoare triple {39086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {39086#false} is VALID [2022-04-15 05:55:24,632 INFO L290 TraceCheckUtils]: 103: Hoare triple {39086#false} ~cond := #in~cond; {39086#false} is VALID [2022-04-15 05:55:24,632 INFO L290 TraceCheckUtils]: 104: Hoare triple {39086#false} assume 0 == ~cond; {39086#false} is VALID [2022-04-15 05:55:24,632 INFO L290 TraceCheckUtils]: 105: Hoare triple {39086#false} assume !false; {39086#false} is VALID [2022-04-15 05:55:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:24,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775506091] [2022-04-15 05:55:24,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775506091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:24,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467883858] [2022-04-15 05:55:24,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:55:24,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:24,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:24,634 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:55:24,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 05:55:24,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:55:24,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:24,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 05:55:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:24,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:25,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {39085#true} call ULTIMATE.init(); {39085#true} is VALID [2022-04-15 05:55:25,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {39085#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(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-15 05:55:25,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-15 05:55:25,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-15 05:55:25,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {39085#true} call #t~ret6 := main(); {39085#true} is VALID [2022-04-15 05:55:25,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {39085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {39157#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:25,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {39157#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39157#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:25,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {39157#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39091#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:25,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {39091#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:25,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {39091#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39092#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:25,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {39092#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:25,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {39092#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39093#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:25,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {39093#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:25,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {39093#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39094#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:25,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {39094#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:25,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {39094#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39095#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:25,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {39095#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:25,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {39095#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39096#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:25,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {39096#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:25,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {39096#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39097#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:25,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {39097#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:25,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {39097#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39098#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:25,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {39098#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:25,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {39098#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39099#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:25,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {39099#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:25,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {39099#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39100#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:25,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {39100#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:25,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {39100#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39101#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:25,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {39101#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:25,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {39101#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39102#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:25,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {39102#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:25,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {39102#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39103#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:25,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {39103#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:25,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {39103#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39104#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:25,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {39104#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:25,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {39104#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39105#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:25,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {39105#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:25,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {39105#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39106#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:25,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {39106#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:25,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {39106#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39107#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:25,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {39107#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:25,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {39107#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39108#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:25,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {39108#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:25,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {39108#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39109#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:25,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {39109#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:25,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {39109#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39110#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:25,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {39110#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:25,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {39110#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39111#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:25,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {39111#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:25,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {39111#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39112#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:25,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {39112#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:25,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {39112#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39113#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:25,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {39113#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:25,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {39113#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39114#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:25,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {39114#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:25,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {39114#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39115#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:25,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {39115#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:25,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {39115#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39116#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:25,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {39116#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:25,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {39116#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39117#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:25,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {39117#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:25,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {39117#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39118#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:25,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {39118#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:25,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {39118#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39119#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:25,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {39119#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:25,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {39119#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39120#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:25,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {39120#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:25,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {39120#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39121#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:25,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {39121#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:25,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {39121#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39122#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:25,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {39122#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:25,683 INFO L290 TraceCheckUtils]: 71: Hoare triple {39122#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39123#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:25,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {39123#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:25,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {39123#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39124#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:25,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {39124#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:25,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {39124#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39125#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:25,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {39125#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:25,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {39125#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39126#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:25,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {39126#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:25,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {39126#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39127#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:25,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {39127#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:25,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {39127#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39128#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:25,687 INFO L290 TraceCheckUtils]: 82: Hoare triple {39128#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:25,687 INFO L290 TraceCheckUtils]: 83: Hoare triple {39128#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39129#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:25,687 INFO L290 TraceCheckUtils]: 84: Hoare triple {39129#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:25,688 INFO L290 TraceCheckUtils]: 85: Hoare triple {39129#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39130#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:25,688 INFO L290 TraceCheckUtils]: 86: Hoare triple {39130#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:25,688 INFO L290 TraceCheckUtils]: 87: Hoare triple {39130#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39131#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:25,688 INFO L290 TraceCheckUtils]: 88: Hoare triple {39131#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:25,689 INFO L290 TraceCheckUtils]: 89: Hoare triple {39131#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39132#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:25,689 INFO L290 TraceCheckUtils]: 90: Hoare triple {39132#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39132#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:25,689 INFO L290 TraceCheckUtils]: 91: Hoare triple {39132#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39133#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:25,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {39133#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39133#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:25,690 INFO L290 TraceCheckUtils]: 93: Hoare triple {39133#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39134#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:25,690 INFO L290 TraceCheckUtils]: 94: Hoare triple {39134#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39134#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:25,691 INFO L290 TraceCheckUtils]: 95: Hoare triple {39134#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39135#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:25,691 INFO L290 TraceCheckUtils]: 96: Hoare triple {39135#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39135#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:25,691 INFO L290 TraceCheckUtils]: 97: Hoare triple {39135#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39136#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:25,692 INFO L290 TraceCheckUtils]: 98: Hoare triple {39136#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39136#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:25,692 INFO L290 TraceCheckUtils]: 99: Hoare triple {39136#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39137#(<= main_~i~0 47)} is VALID [2022-04-15 05:55:25,692 INFO L290 TraceCheckUtils]: 100: Hoare triple {39137#(<= main_~i~0 47)} assume !(~i~0 < 1024); {39086#false} is VALID [2022-04-15 05:55:25,692 INFO L290 TraceCheckUtils]: 101: Hoare triple {39086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {39086#false} is VALID [2022-04-15 05:55:25,692 INFO L272 TraceCheckUtils]: 102: Hoare triple {39086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {39086#false} is VALID [2022-04-15 05:55:25,692 INFO L290 TraceCheckUtils]: 103: Hoare triple {39086#false} ~cond := #in~cond; {39086#false} is VALID [2022-04-15 05:55:25,692 INFO L290 TraceCheckUtils]: 104: Hoare triple {39086#false} assume 0 == ~cond; {39086#false} is VALID [2022-04-15 05:55:25,693 INFO L290 TraceCheckUtils]: 105: Hoare triple {39086#false} assume !false; {39086#false} is VALID [2022-04-15 05:55:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:25,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:28,449 INFO L290 TraceCheckUtils]: 105: Hoare triple {39086#false} assume !false; {39086#false} is VALID [2022-04-15 05:55:28,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {39086#false} assume 0 == ~cond; {39086#false} is VALID [2022-04-15 05:55:28,449 INFO L290 TraceCheckUtils]: 103: Hoare triple {39086#false} ~cond := #in~cond; {39086#false} is VALID [2022-04-15 05:55:28,449 INFO L272 TraceCheckUtils]: 102: Hoare triple {39086#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {39086#false} is VALID [2022-04-15 05:55:28,449 INFO L290 TraceCheckUtils]: 101: Hoare triple {39086#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {39086#false} is VALID [2022-04-15 05:55:28,449 INFO L290 TraceCheckUtils]: 100: Hoare triple {39473#(< main_~i~0 1024)} assume !(~i~0 < 1024); {39086#false} is VALID [2022-04-15 05:55:28,450 INFO L290 TraceCheckUtils]: 99: Hoare triple {39477#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39473#(< main_~i~0 1024)} is VALID [2022-04-15 05:55:28,450 INFO L290 TraceCheckUtils]: 98: Hoare triple {39477#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39477#(< main_~i~0 1023)} is VALID [2022-04-15 05:55:28,450 INFO L290 TraceCheckUtils]: 97: Hoare triple {39484#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39477#(< main_~i~0 1023)} is VALID [2022-04-15 05:55:28,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {39484#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39484#(< main_~i~0 1022)} is VALID [2022-04-15 05:55:28,451 INFO L290 TraceCheckUtils]: 95: Hoare triple {39491#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39484#(< main_~i~0 1022)} is VALID [2022-04-15 05:55:28,451 INFO L290 TraceCheckUtils]: 94: Hoare triple {39491#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39491#(< main_~i~0 1021)} is VALID [2022-04-15 05:55:28,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {39498#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39491#(< main_~i~0 1021)} is VALID [2022-04-15 05:55:28,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {39498#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39498#(< main_~i~0 1020)} is VALID [2022-04-15 05:55:28,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {39505#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39498#(< main_~i~0 1020)} is VALID [2022-04-15 05:55:28,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {39505#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39505#(< main_~i~0 1019)} is VALID [2022-04-15 05:55:28,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {39512#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39505#(< main_~i~0 1019)} is VALID [2022-04-15 05:55:28,453 INFO L290 TraceCheckUtils]: 88: Hoare triple {39512#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39512#(< main_~i~0 1018)} is VALID [2022-04-15 05:55:28,454 INFO L290 TraceCheckUtils]: 87: Hoare triple {39519#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39512#(< main_~i~0 1018)} is VALID [2022-04-15 05:55:28,454 INFO L290 TraceCheckUtils]: 86: Hoare triple {39519#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39519#(< main_~i~0 1017)} is VALID [2022-04-15 05:55:28,454 INFO L290 TraceCheckUtils]: 85: Hoare triple {39526#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39519#(< main_~i~0 1017)} is VALID [2022-04-15 05:55:28,454 INFO L290 TraceCheckUtils]: 84: Hoare triple {39526#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39526#(< main_~i~0 1016)} is VALID [2022-04-15 05:55:28,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {39533#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39526#(< main_~i~0 1016)} is VALID [2022-04-15 05:55:28,455 INFO L290 TraceCheckUtils]: 82: Hoare triple {39533#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39533#(< main_~i~0 1015)} is VALID [2022-04-15 05:55:28,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {39540#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39533#(< main_~i~0 1015)} is VALID [2022-04-15 05:55:28,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {39540#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39540#(< main_~i~0 1014)} is VALID [2022-04-15 05:55:28,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {39547#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39540#(< main_~i~0 1014)} is VALID [2022-04-15 05:55:28,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {39547#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39547#(< main_~i~0 1013)} is VALID [2022-04-15 05:55:28,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {39554#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39547#(< main_~i~0 1013)} is VALID [2022-04-15 05:55:28,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {39554#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39554#(< main_~i~0 1012)} is VALID [2022-04-15 05:55:28,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {39561#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39554#(< main_~i~0 1012)} is VALID [2022-04-15 05:55:28,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {39561#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39561#(< main_~i~0 1011)} is VALID [2022-04-15 05:55:28,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {39568#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39561#(< main_~i~0 1011)} is VALID [2022-04-15 05:55:28,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {39568#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39568#(< main_~i~0 1010)} is VALID [2022-04-15 05:55:28,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {39575#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39568#(< main_~i~0 1010)} is VALID [2022-04-15 05:55:28,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {39575#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39575#(< main_~i~0 1009)} is VALID [2022-04-15 05:55:28,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {39582#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39575#(< main_~i~0 1009)} is VALID [2022-04-15 05:55:28,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {39582#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39582#(< main_~i~0 1008)} is VALID [2022-04-15 05:55:28,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {39589#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39582#(< main_~i~0 1008)} is VALID [2022-04-15 05:55:28,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {39589#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39589#(< main_~i~0 1007)} is VALID [2022-04-15 05:55:28,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {39596#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39589#(< main_~i~0 1007)} is VALID [2022-04-15 05:55:28,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {39596#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39596#(< main_~i~0 1006)} is VALID [2022-04-15 05:55:28,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {39603#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39596#(< main_~i~0 1006)} is VALID [2022-04-15 05:55:28,461 INFO L290 TraceCheckUtils]: 62: Hoare triple {39603#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39603#(< main_~i~0 1005)} is VALID [2022-04-15 05:55:28,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {39610#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39603#(< main_~i~0 1005)} is VALID [2022-04-15 05:55:28,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {39610#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39610#(< main_~i~0 1004)} is VALID [2022-04-15 05:55:28,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {39617#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39610#(< main_~i~0 1004)} is VALID [2022-04-15 05:55:28,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {39617#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39617#(< main_~i~0 1003)} is VALID [2022-04-15 05:55:28,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {39624#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39617#(< main_~i~0 1003)} is VALID [2022-04-15 05:55:28,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {39624#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39624#(< main_~i~0 1002)} is VALID [2022-04-15 05:55:28,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {39631#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39624#(< main_~i~0 1002)} is VALID [2022-04-15 05:55:28,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {39631#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39631#(< main_~i~0 1001)} is VALID [2022-04-15 05:55:28,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {39638#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39631#(< main_~i~0 1001)} is VALID [2022-04-15 05:55:28,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {39638#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39638#(< main_~i~0 1000)} is VALID [2022-04-15 05:55:28,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {39645#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39638#(< main_~i~0 1000)} is VALID [2022-04-15 05:55:28,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {39645#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39645#(< main_~i~0 999)} is VALID [2022-04-15 05:55:28,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {39652#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39645#(< main_~i~0 999)} is VALID [2022-04-15 05:55:28,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {39652#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39652#(< main_~i~0 998)} is VALID [2022-04-15 05:55:28,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {39659#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39652#(< main_~i~0 998)} is VALID [2022-04-15 05:55:28,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {39659#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39659#(< main_~i~0 997)} is VALID [2022-04-15 05:55:28,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {39666#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39659#(< main_~i~0 997)} is VALID [2022-04-15 05:55:28,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {39666#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39666#(< main_~i~0 996)} is VALID [2022-04-15 05:55:28,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {39673#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39666#(< main_~i~0 996)} is VALID [2022-04-15 05:55:28,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {39673#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39673#(< main_~i~0 995)} is VALID [2022-04-15 05:55:28,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {39680#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39673#(< main_~i~0 995)} is VALID [2022-04-15 05:55:28,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {39680#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39680#(< main_~i~0 994)} is VALID [2022-04-15 05:55:28,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {39687#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39680#(< main_~i~0 994)} is VALID [2022-04-15 05:55:28,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {39687#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39687#(< main_~i~0 993)} is VALID [2022-04-15 05:55:28,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {39694#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39687#(< main_~i~0 993)} is VALID [2022-04-15 05:55:28,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {39694#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39694#(< main_~i~0 992)} is VALID [2022-04-15 05:55:28,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {39701#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39694#(< main_~i~0 992)} is VALID [2022-04-15 05:55:28,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {39701#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39701#(< main_~i~0 991)} is VALID [2022-04-15 05:55:28,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {39708#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39701#(< main_~i~0 991)} is VALID [2022-04-15 05:55:28,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {39708#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39708#(< main_~i~0 990)} is VALID [2022-04-15 05:55:28,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {39715#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39708#(< main_~i~0 990)} is VALID [2022-04-15 05:55:28,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {39715#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39715#(< main_~i~0 989)} is VALID [2022-04-15 05:55:28,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {39722#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39715#(< main_~i~0 989)} is VALID [2022-04-15 05:55:28,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {39722#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39722#(< main_~i~0 988)} is VALID [2022-04-15 05:55:28,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {39729#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39722#(< main_~i~0 988)} is VALID [2022-04-15 05:55:28,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {39729#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39729#(< main_~i~0 987)} is VALID [2022-04-15 05:55:28,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {39736#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39729#(< main_~i~0 987)} is VALID [2022-04-15 05:55:28,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {39736#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39736#(< main_~i~0 986)} is VALID [2022-04-15 05:55:28,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {39743#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39736#(< main_~i~0 986)} is VALID [2022-04-15 05:55:28,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {39743#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39743#(< main_~i~0 985)} is VALID [2022-04-15 05:55:28,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {39750#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39743#(< main_~i~0 985)} is VALID [2022-04-15 05:55:28,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {39750#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39750#(< main_~i~0 984)} is VALID [2022-04-15 05:55:28,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {39757#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39750#(< main_~i~0 984)} is VALID [2022-04-15 05:55:28,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {39757#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39757#(< main_~i~0 983)} is VALID [2022-04-15 05:55:28,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {39764#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39757#(< main_~i~0 983)} is VALID [2022-04-15 05:55:28,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {39764#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39764#(< main_~i~0 982)} is VALID [2022-04-15 05:55:28,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {39771#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39764#(< main_~i~0 982)} is VALID [2022-04-15 05:55:28,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {39771#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39771#(< main_~i~0 981)} is VALID [2022-04-15 05:55:28,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {39778#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39771#(< main_~i~0 981)} is VALID [2022-04-15 05:55:28,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {39778#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39778#(< main_~i~0 980)} is VALID [2022-04-15 05:55:28,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {39785#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39778#(< main_~i~0 980)} is VALID [2022-04-15 05:55:28,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {39785#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39785#(< main_~i~0 979)} is VALID [2022-04-15 05:55:28,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {39792#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39785#(< main_~i~0 979)} is VALID [2022-04-15 05:55:28,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {39792#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39792#(< main_~i~0 978)} is VALID [2022-04-15 05:55:28,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {39799#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {39792#(< main_~i~0 978)} is VALID [2022-04-15 05:55:28,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {39799#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {39799#(< main_~i~0 977)} is VALID [2022-04-15 05:55:28,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {39085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {39799#(< main_~i~0 977)} is VALID [2022-04-15 05:55:28,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {39085#true} call #t~ret6 := main(); {39085#true} is VALID [2022-04-15 05:55:28,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39085#true} {39085#true} #39#return; {39085#true} is VALID [2022-04-15 05:55:28,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {39085#true} assume true; {39085#true} is VALID [2022-04-15 05:55:28,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {39085#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(12, 2);call #Ultimate.allocInit(12, 3); {39085#true} is VALID [2022-04-15 05:55:28,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {39085#true} call ULTIMATE.init(); {39085#true} is VALID [2022-04-15 05:55:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467883858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:28,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:28,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-15 05:55:28,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751309154] [2022-04-15 05:55:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751309154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:28,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:28,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 05:55:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232105414] [2022-04-15 05:55:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 05:55:28,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:28,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:28,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:28,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 05:55:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 05:55:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 05:55:28,550 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:30,359 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-15 05:55:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 05:55:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 05:55:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-15 05:55:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-15 05:55:30,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 116 transitions. [2022-04-15 05:55:30,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:30,445 INFO L225 Difference]: With dead ends: 116 [2022-04-15 05:55:30,445 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 05:55:30,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9606, Invalid=12150, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 05:55:30,447 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:55:30,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 44 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:55:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 05:55:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 05:55:30,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:30,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,958 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,958 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:30,959 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-15 05:55:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-15 05:55:30,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:30,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:30,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-15 05:55:30,960 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-15 05:55:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:30,961 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-15 05:55:30,961 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-15 05:55:30,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:30,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:30,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:30,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-04-15 05:55:30,963 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2022-04-15 05:55:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:30,963 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-04-15 05:55:30,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:55:30,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 109 transitions. [2022-04-15 05:55:31,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-04-15 05:55:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 05:55:31,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:31,093 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:31,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-15 05:55:31,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-15 05:55:31,293 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1380897830, now seen corresponding path program 95 times [2022-04-15 05:55:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:31,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413270577] [2022-04-15 05:55:31,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:31,296 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:31,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1380897830, now seen corresponding path program 96 times [2022-04-15 05:55:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278293142] [2022-04-15 05:55:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:32,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {40643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-15 05:55:32,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-15 05:55:32,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-15 05:55:32,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {40589#true} call ULTIMATE.init(); {40643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:32,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {40643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-15 05:55:32,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-15 05:55:32,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-15 05:55:32,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {40589#true} call #t~ret6 := main(); {40589#true} is VALID [2022-04-15 05:55:32,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {40589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {40594#(= main_~i~0 0)} is VALID [2022-04-15 05:55:32,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40594#(= main_~i~0 0)} is VALID [2022-04-15 05:55:32,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40595#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:32,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {40595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40595#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:32,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {40595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40596#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:32,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {40596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40596#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:32,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {40596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40597#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:32,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {40597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40597#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:32,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {40597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40598#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:32,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {40598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40598#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:32,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {40598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40599#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:32,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {40599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40599#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:32,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {40599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40600#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:32,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {40600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40600#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:32,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {40600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40601#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:32,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {40601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40601#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:32,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {40601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40602#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:32,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {40602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40602#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:32,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {40602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40603#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:32,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {40603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40603#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:32,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {40603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40604#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:32,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {40604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40604#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:32,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {40604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40605#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:32,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {40605#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40605#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:32,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {40605#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40606#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:32,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {40606#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40606#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:32,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {40606#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40607#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:32,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {40607#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40607#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:32,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {40607#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40608#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:32,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {40608#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40608#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:32,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {40608#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40609#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:32,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {40609#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40609#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:32,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {40609#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40610#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:32,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {40610#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40610#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:32,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {40610#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40611#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:32,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {40611#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40611#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:32,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {40611#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40612#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:32,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {40612#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40612#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:32,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {40612#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40613#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:32,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {40613#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40613#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:32,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {40613#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40614#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:32,415 INFO L290 TraceCheckUtils]: 46: Hoare triple {40614#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40614#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:32,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {40614#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40615#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:32,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {40615#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40615#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:32,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {40615#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40616#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:32,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {40616#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40616#(<= main_~i~0 22)} is VALID [2022-04-15 05:55:32,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {40616#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40617#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:32,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {40617#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40617#(<= main_~i~0 23)} is VALID [2022-04-15 05:55:32,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {40617#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40618#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:32,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {40618#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40618#(<= main_~i~0 24)} is VALID [2022-04-15 05:55:32,419 INFO L290 TraceCheckUtils]: 55: Hoare triple {40618#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40619#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:32,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {40619#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40619#(<= main_~i~0 25)} is VALID [2022-04-15 05:55:32,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {40619#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40620#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:32,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {40620#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40620#(<= main_~i~0 26)} is VALID [2022-04-15 05:55:32,420 INFO L290 TraceCheckUtils]: 59: Hoare triple {40620#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40621#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:32,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {40621#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40621#(<= main_~i~0 27)} is VALID [2022-04-15 05:55:32,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {40621#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40622#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:32,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {40622#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40622#(<= main_~i~0 28)} is VALID [2022-04-15 05:55:32,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {40622#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40623#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:32,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {40623#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40623#(<= main_~i~0 29)} is VALID [2022-04-15 05:55:32,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {40623#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40624#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:32,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {40624#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40624#(<= main_~i~0 30)} is VALID [2022-04-15 05:55:32,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {40624#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40625#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:32,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {40625#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40625#(<= main_~i~0 31)} is VALID [2022-04-15 05:55:32,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {40625#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40626#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:32,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {40626#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40626#(<= main_~i~0 32)} is VALID [2022-04-15 05:55:32,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {40626#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40627#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:32,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {40627#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40627#(<= main_~i~0 33)} is VALID [2022-04-15 05:55:32,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {40627#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40628#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:32,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {40628#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40628#(<= main_~i~0 34)} is VALID [2022-04-15 05:55:32,427 INFO L290 TraceCheckUtils]: 75: Hoare triple {40628#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40629#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:32,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {40629#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40629#(<= main_~i~0 35)} is VALID [2022-04-15 05:55:32,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {40629#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40630#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:32,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {40630#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40630#(<= main_~i~0 36)} is VALID [2022-04-15 05:55:32,428 INFO L290 TraceCheckUtils]: 79: Hoare triple {40630#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40631#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:32,428 INFO L290 TraceCheckUtils]: 80: Hoare triple {40631#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40631#(<= main_~i~0 37)} is VALID [2022-04-15 05:55:32,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {40631#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40632#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:32,429 INFO L290 TraceCheckUtils]: 82: Hoare triple {40632#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40632#(<= main_~i~0 38)} is VALID [2022-04-15 05:55:32,430 INFO L290 TraceCheckUtils]: 83: Hoare triple {40632#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40633#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:32,430 INFO L290 TraceCheckUtils]: 84: Hoare triple {40633#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40633#(<= main_~i~0 39)} is VALID [2022-04-15 05:55:32,431 INFO L290 TraceCheckUtils]: 85: Hoare triple {40633#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40634#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:32,431 INFO L290 TraceCheckUtils]: 86: Hoare triple {40634#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40634#(<= main_~i~0 40)} is VALID [2022-04-15 05:55:32,431 INFO L290 TraceCheckUtils]: 87: Hoare triple {40634#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40635#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:32,432 INFO L290 TraceCheckUtils]: 88: Hoare triple {40635#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40635#(<= main_~i~0 41)} is VALID [2022-04-15 05:55:32,432 INFO L290 TraceCheckUtils]: 89: Hoare triple {40635#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40636#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:32,432 INFO L290 TraceCheckUtils]: 90: Hoare triple {40636#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40636#(<= main_~i~0 42)} is VALID [2022-04-15 05:55:32,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {40636#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40637#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:32,433 INFO L290 TraceCheckUtils]: 92: Hoare triple {40637#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40637#(<= main_~i~0 43)} is VALID [2022-04-15 05:55:32,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {40637#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40638#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:32,434 INFO L290 TraceCheckUtils]: 94: Hoare triple {40638#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40638#(<= main_~i~0 44)} is VALID [2022-04-15 05:55:32,434 INFO L290 TraceCheckUtils]: 95: Hoare triple {40638#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40639#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:32,435 INFO L290 TraceCheckUtils]: 96: Hoare triple {40639#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40639#(<= main_~i~0 45)} is VALID [2022-04-15 05:55:32,435 INFO L290 TraceCheckUtils]: 97: Hoare triple {40639#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40640#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:32,436 INFO L290 TraceCheckUtils]: 98: Hoare triple {40640#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40640#(<= main_~i~0 46)} is VALID [2022-04-15 05:55:32,436 INFO L290 TraceCheckUtils]: 99: Hoare triple {40640#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40641#(<= main_~i~0 47)} is VALID [2022-04-15 05:55:32,436 INFO L290 TraceCheckUtils]: 100: Hoare triple {40641#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40641#(<= main_~i~0 47)} is VALID [2022-04-15 05:55:32,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {40641#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40642#(<= main_~i~0 48)} is VALID [2022-04-15 05:55:32,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {40642#(<= main_~i~0 48)} assume !(~i~0 < 1024); {40590#false} is VALID [2022-04-15 05:55:32,437 INFO L290 TraceCheckUtils]: 103: Hoare triple {40590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {40590#false} is VALID [2022-04-15 05:55:32,437 INFO L272 TraceCheckUtils]: 104: Hoare triple {40590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {40590#false} is VALID [2022-04-15 05:55:32,437 INFO L290 TraceCheckUtils]: 105: Hoare triple {40590#false} ~cond := #in~cond; {40590#false} is VALID [2022-04-15 05:55:32,438 INFO L290 TraceCheckUtils]: 106: Hoare triple {40590#false} assume 0 == ~cond; {40590#false} is VALID [2022-04-15 05:55:32,438 INFO L290 TraceCheckUtils]: 107: Hoare triple {40590#false} assume !false; {40590#false} is VALID [2022-04-15 05:55:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:55:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:32,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278293142] [2022-04-15 05:55:32,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278293142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:32,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597073677] [2022-04-15 05:55:32,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:55:32,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:32,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:32,440 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:55:32,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-15 05:57:44,133 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2022-04-15 05:57:44,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:44,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 05:57:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:44,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:44,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {40589#true} call ULTIMATE.init(); {40589#true} is VALID [2022-04-15 05:57:44,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {40589#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(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-15 05:57:44,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-15 05:57:44,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-15 05:57:44,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {40589#true} call #t~ret6 := main(); {40589#true} is VALID [2022-04-15 05:57:44,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {40589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {40662#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:44,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {40662#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40662#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:44,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {40662#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40595#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:44,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {40595#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40595#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:44,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {40595#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40596#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:44,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {40596#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40596#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:44,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {40596#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40597#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:44,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {40597#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40597#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:44,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {40597#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40598#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:44,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {40598#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40598#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:44,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {40598#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40599#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:44,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {40599#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40599#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:44,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {40599#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40600#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:44,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {40600#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40600#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:44,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {40600#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40601#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:44,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {40601#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40601#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:44,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {40601#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40602#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:44,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {40602#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40602#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:44,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {40602#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40603#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:44,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {40603#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40603#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:44,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {40603#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40604#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:44,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {40604#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40604#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:44,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {40604#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40605#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:44,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {40605#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40605#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:44,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {40605#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40606#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:44,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {40606#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40606#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:44,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {40606#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40607#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:44,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {40607#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40607#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:44,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {40607#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40608#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:44,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {40608#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40608#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:44,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {40608#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40609#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:44,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {40609#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40609#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:44,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {40609#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40610#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:44,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {40610#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40610#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:44,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {40610#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40611#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:44,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {40611#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40611#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:44,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {40611#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40612#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:44,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {40612#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40612#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:44,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {40612#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40613#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:44,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {40613#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40613#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:44,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {40613#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40614#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:44,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {40614#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40614#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:44,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {40614#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40615#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:44,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {40615#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40615#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:44,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {40615#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40616#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:44,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {40616#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40616#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:44,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {40616#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40617#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:44,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {40617#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40617#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:44,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {40617#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40618#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:44,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {40618#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40618#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:44,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {40618#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40619#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:44,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {40619#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40619#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:44,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {40619#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40620#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:44,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {40620#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40620#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:44,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {40620#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40621#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:44,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {40621#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40621#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:44,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {40621#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40622#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:44,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {40622#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40622#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:44,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {40622#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40623#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:44,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {40623#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40623#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:44,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {40623#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40624#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:44,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {40624#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40624#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:44,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {40624#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40625#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:44,921 INFO L290 TraceCheckUtils]: 68: Hoare triple {40625#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40625#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:44,921 INFO L290 TraceCheckUtils]: 69: Hoare triple {40625#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40626#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:44,921 INFO L290 TraceCheckUtils]: 70: Hoare triple {40626#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40626#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:44,922 INFO L290 TraceCheckUtils]: 71: Hoare triple {40626#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40627#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:44,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {40627#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40627#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:44,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {40627#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40628#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:44,923 INFO L290 TraceCheckUtils]: 74: Hoare triple {40628#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40628#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:44,923 INFO L290 TraceCheckUtils]: 75: Hoare triple {40628#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40629#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:44,923 INFO L290 TraceCheckUtils]: 76: Hoare triple {40629#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40629#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:44,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {40629#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40630#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:44,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {40630#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40630#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:44,924 INFO L290 TraceCheckUtils]: 79: Hoare triple {40630#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40631#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:44,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {40631#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40631#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:44,925 INFO L290 TraceCheckUtils]: 81: Hoare triple {40631#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40632#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:44,925 INFO L290 TraceCheckUtils]: 82: Hoare triple {40632#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40632#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:44,925 INFO L290 TraceCheckUtils]: 83: Hoare triple {40632#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40633#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:44,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {40633#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40633#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:44,926 INFO L290 TraceCheckUtils]: 85: Hoare triple {40633#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40634#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:44,926 INFO L290 TraceCheckUtils]: 86: Hoare triple {40634#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40634#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:44,927 INFO L290 TraceCheckUtils]: 87: Hoare triple {40634#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40635#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:44,927 INFO L290 TraceCheckUtils]: 88: Hoare triple {40635#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40635#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:44,927 INFO L290 TraceCheckUtils]: 89: Hoare triple {40635#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40636#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:44,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {40636#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40636#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:44,928 INFO L290 TraceCheckUtils]: 91: Hoare triple {40636#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40637#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:44,928 INFO L290 TraceCheckUtils]: 92: Hoare triple {40637#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40637#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:44,928 INFO L290 TraceCheckUtils]: 93: Hoare triple {40637#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40638#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:44,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {40638#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40638#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:44,929 INFO L290 TraceCheckUtils]: 95: Hoare triple {40638#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40639#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:44,929 INFO L290 TraceCheckUtils]: 96: Hoare triple {40639#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40639#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:44,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {40639#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40640#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:44,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {40640#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40640#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:44,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {40640#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40641#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:44,931 INFO L290 TraceCheckUtils]: 100: Hoare triple {40641#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40641#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:44,931 INFO L290 TraceCheckUtils]: 101: Hoare triple {40641#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40642#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:44,931 INFO L290 TraceCheckUtils]: 102: Hoare triple {40642#(<= main_~i~0 48)} assume !(~i~0 < 1024); {40590#false} is VALID [2022-04-15 05:57:44,931 INFO L290 TraceCheckUtils]: 103: Hoare triple {40590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {40590#false} is VALID [2022-04-15 05:57:44,931 INFO L272 TraceCheckUtils]: 104: Hoare triple {40590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {40590#false} is VALID [2022-04-15 05:57:44,931 INFO L290 TraceCheckUtils]: 105: Hoare triple {40590#false} ~cond := #in~cond; {40590#false} is VALID [2022-04-15 05:57:44,931 INFO L290 TraceCheckUtils]: 106: Hoare triple {40590#false} assume 0 == ~cond; {40590#false} is VALID [2022-04-15 05:57:44,932 INFO L290 TraceCheckUtils]: 107: Hoare triple {40590#false} assume !false; {40590#false} is VALID [2022-04-15 05:57:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:44,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:47,788 INFO L290 TraceCheckUtils]: 107: Hoare triple {40590#false} assume !false; {40590#false} is VALID [2022-04-15 05:57:47,789 INFO L290 TraceCheckUtils]: 106: Hoare triple {40590#false} assume 0 == ~cond; {40590#false} is VALID [2022-04-15 05:57:47,789 INFO L290 TraceCheckUtils]: 105: Hoare triple {40590#false} ~cond := #in~cond; {40590#false} is VALID [2022-04-15 05:57:47,789 INFO L272 TraceCheckUtils]: 104: Hoare triple {40590#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {40590#false} is VALID [2022-04-15 05:57:47,789 INFO L290 TraceCheckUtils]: 103: Hoare triple {40590#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {40590#false} is VALID [2022-04-15 05:57:47,789 INFO L290 TraceCheckUtils]: 102: Hoare triple {40984#(< main_~i~0 1024)} assume !(~i~0 < 1024); {40590#false} is VALID [2022-04-15 05:57:47,789 INFO L290 TraceCheckUtils]: 101: Hoare triple {40988#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40984#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:47,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {40988#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40988#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:47,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {40995#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40988#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:47,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {40995#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40995#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:47,791 INFO L290 TraceCheckUtils]: 97: Hoare triple {41002#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {40995#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:47,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {41002#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41002#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:47,791 INFO L290 TraceCheckUtils]: 95: Hoare triple {41009#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41002#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:47,792 INFO L290 TraceCheckUtils]: 94: Hoare triple {41009#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41009#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:47,792 INFO L290 TraceCheckUtils]: 93: Hoare triple {41016#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41009#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:47,792 INFO L290 TraceCheckUtils]: 92: Hoare triple {41016#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41016#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:47,793 INFO L290 TraceCheckUtils]: 91: Hoare triple {41023#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41016#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:47,793 INFO L290 TraceCheckUtils]: 90: Hoare triple {41023#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41023#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:47,793 INFO L290 TraceCheckUtils]: 89: Hoare triple {41030#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41023#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:47,793 INFO L290 TraceCheckUtils]: 88: Hoare triple {41030#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41030#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:47,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {41037#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41030#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:47,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {41037#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41037#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:47,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {41044#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41037#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:47,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {41044#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41044#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:47,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {41051#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41044#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:47,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {41051#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41051#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:47,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {41058#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41051#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:47,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {41058#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41058#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:47,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {41065#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41058#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:47,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {41065#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41065#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:47,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {41072#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41065#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:47,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {41072#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41072#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:47,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {41079#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41072#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:47,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {41079#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41079#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:47,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {41086#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41079#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:47,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {41086#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41086#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:47,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {41093#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41086#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:47,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {41093#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41093#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:47,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {41100#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41093#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:47,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {41100#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41100#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:47,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {41107#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41100#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:47,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {41107#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41107#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:47,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {41114#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41107#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:47,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {41114#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41114#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:47,801 INFO L290 TraceCheckUtils]: 63: Hoare triple {41121#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41114#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:47,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {41121#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41121#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:47,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {41128#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41121#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:47,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {41128#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41128#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:47,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {41135#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41128#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:47,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {41135#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41135#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:47,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {41142#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41135#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:47,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {41142#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41142#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:47,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {41149#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41142#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:47,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {41149#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41149#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:47,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {41156#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41149#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:47,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {41156#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41156#(< main_~i~0 999)} is VALID [2022-04-15 05:57:47,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {41163#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41156#(< main_~i~0 999)} is VALID [2022-04-15 05:57:47,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {41163#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41163#(< main_~i~0 998)} is VALID [2022-04-15 05:57:47,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {41170#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41163#(< main_~i~0 998)} is VALID [2022-04-15 05:57:47,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {41170#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41170#(< main_~i~0 997)} is VALID [2022-04-15 05:57:47,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {41177#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41170#(< main_~i~0 997)} is VALID [2022-04-15 05:57:47,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {41177#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41177#(< main_~i~0 996)} is VALID [2022-04-15 05:57:47,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {41184#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41177#(< main_~i~0 996)} is VALID [2022-04-15 05:57:47,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {41184#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41184#(< main_~i~0 995)} is VALID [2022-04-15 05:57:47,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {41191#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41184#(< main_~i~0 995)} is VALID [2022-04-15 05:57:47,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {41191#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41191#(< main_~i~0 994)} is VALID [2022-04-15 05:57:47,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {41198#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41191#(< main_~i~0 994)} is VALID [2022-04-15 05:57:47,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {41198#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41198#(< main_~i~0 993)} is VALID [2022-04-15 05:57:47,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {41205#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41198#(< main_~i~0 993)} is VALID [2022-04-15 05:57:47,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {41205#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41205#(< main_~i~0 992)} is VALID [2022-04-15 05:57:47,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {41212#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41205#(< main_~i~0 992)} is VALID [2022-04-15 05:57:47,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {41212#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41212#(< main_~i~0 991)} is VALID [2022-04-15 05:57:47,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {41219#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41212#(< main_~i~0 991)} is VALID [2022-04-15 05:57:47,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {41219#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41219#(< main_~i~0 990)} is VALID [2022-04-15 05:57:47,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {41226#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41219#(< main_~i~0 990)} is VALID [2022-04-15 05:57:47,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {41226#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41226#(< main_~i~0 989)} is VALID [2022-04-15 05:57:47,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {41233#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41226#(< main_~i~0 989)} is VALID [2022-04-15 05:57:47,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {41233#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41233#(< main_~i~0 988)} is VALID [2022-04-15 05:57:47,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {41240#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41233#(< main_~i~0 988)} is VALID [2022-04-15 05:57:47,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {41240#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41240#(< main_~i~0 987)} is VALID [2022-04-15 05:57:47,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {41247#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41240#(< main_~i~0 987)} is VALID [2022-04-15 05:57:47,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {41247#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41247#(< main_~i~0 986)} is VALID [2022-04-15 05:57:47,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {41254#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41247#(< main_~i~0 986)} is VALID [2022-04-15 05:57:47,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {41254#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41254#(< main_~i~0 985)} is VALID [2022-04-15 05:57:47,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {41261#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41254#(< main_~i~0 985)} is VALID [2022-04-15 05:57:47,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {41261#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41261#(< main_~i~0 984)} is VALID [2022-04-15 05:57:47,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {41268#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41261#(< main_~i~0 984)} is VALID [2022-04-15 05:57:47,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {41268#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41268#(< main_~i~0 983)} is VALID [2022-04-15 05:57:47,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {41275#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41268#(< main_~i~0 983)} is VALID [2022-04-15 05:57:47,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {41275#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41275#(< main_~i~0 982)} is VALID [2022-04-15 05:57:47,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {41282#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41275#(< main_~i~0 982)} is VALID [2022-04-15 05:57:47,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {41282#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41282#(< main_~i~0 981)} is VALID [2022-04-15 05:57:47,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {41289#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41282#(< main_~i~0 981)} is VALID [2022-04-15 05:57:47,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {41289#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41289#(< main_~i~0 980)} is VALID [2022-04-15 05:57:47,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {41296#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41289#(< main_~i~0 980)} is VALID [2022-04-15 05:57:47,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {41296#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41296#(< main_~i~0 979)} is VALID [2022-04-15 05:57:47,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {41303#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41296#(< main_~i~0 979)} is VALID [2022-04-15 05:57:47,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {41303#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41303#(< main_~i~0 978)} is VALID [2022-04-15 05:57:47,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {41310#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41303#(< main_~i~0 978)} is VALID [2022-04-15 05:57:47,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {41310#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41310#(< main_~i~0 977)} is VALID [2022-04-15 05:57:47,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {41317#(< main_~i~0 976)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {41310#(< main_~i~0 977)} is VALID [2022-04-15 05:57:47,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {41317#(< main_~i~0 976)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {41317#(< main_~i~0 976)} is VALID [2022-04-15 05:57:47,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {40589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {41317#(< main_~i~0 976)} is VALID [2022-04-15 05:57:47,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {40589#true} call #t~ret6 := main(); {40589#true} is VALID [2022-04-15 05:57:47,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40589#true} {40589#true} #39#return; {40589#true} is VALID [2022-04-15 05:57:47,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {40589#true} assume true; {40589#true} is VALID [2022-04-15 05:57:47,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {40589#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(12, 2);call #Ultimate.allocInit(12, 3); {40589#true} is VALID [2022-04-15 05:57:47,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {40589#true} call ULTIMATE.init(); {40589#true} is VALID [2022-04-15 05:57:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:47,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597073677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:47,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:47,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-15 05:57:47,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:47,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413270577] [2022-04-15 05:57:47,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413270577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:47,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:47,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 05:57:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912982553] [2022-04-15 05:57:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 05:57:47,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:47,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:47,898 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-15 05:57:47,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 05:57:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 05:57:47,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 05:57:47,900 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:49,743 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-15 05:57:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 05:57:49,743 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 05:57:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-15 05:57:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-15 05:57:49,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 118 transitions. [2022-04-15 05:57:49,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:49,839 INFO L225 Difference]: With dead ends: 118 [2022-04-15 05:57:49,839 INFO L226 Difference]: Without dead ends: 112 [2022-04-15 05:57:49,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 05:57:49,842 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 106 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:49,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 39 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:57:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-15 05:57:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-04-15 05:57:50,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:50,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:50,372 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:50,373 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:50,373 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-15 05:57:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-15 05:57:50,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:50,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:50,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 112 states. [2022-04-15 05:57:50,375 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 112 states. [2022-04-15 05:57:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:50,377 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-15 05:57:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-15 05:57:50,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:50,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:50,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:50,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2022-04-15 05:57:50,378 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2022-04-15 05:57:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:50,379 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2022-04-15 05:57:50,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:50,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 111 transitions. [2022-04-15 05:57:50,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-04-15 05:57:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 05:57:50,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:50,554 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:50,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:50,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-15 05:57:50,776 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash -772007716, now seen corresponding path program 97 times [2022-04-15 05:57:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:50,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213594867] [2022-04-15 05:57:50,781 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:50,781 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:50,781 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -772007716, now seen corresponding path program 98 times [2022-04-15 05:57:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:50,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121453049] [2022-04-15 05:57:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:51,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {42176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-15 05:57:51,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-15 05:57:51,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-15 05:57:51,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {42121#true} call ULTIMATE.init(); {42176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:51,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {42176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-15 05:57:51,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-15 05:57:51,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-15 05:57:51,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {42121#true} call #t~ret6 := main(); {42121#true} is VALID [2022-04-15 05:57:51,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {42121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {42126#(= main_~i~0 0)} is VALID [2022-04-15 05:57:51,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {42126#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42126#(= main_~i~0 0)} is VALID [2022-04-15 05:57:51,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {42126#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42127#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:51,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {42127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42127#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:51,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {42127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42128#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:51,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {42128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42128#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:51,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {42128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42129#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:51,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {42129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42129#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:51,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {42129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42130#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:51,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {42130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42130#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:51,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {42130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42131#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:51,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {42131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42131#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:51,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {42131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42132#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:51,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {42132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42132#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:51,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {42132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42133#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:51,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {42133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42133#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:51,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {42133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42134#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:51,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {42134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42134#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:51,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {42134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42135#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:51,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {42135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42135#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:51,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {42135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42136#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:51,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {42136#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42136#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:51,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {42136#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42137#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:51,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {42137#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42137#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:51,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {42137#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42138#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:51,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {42138#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42138#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:51,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {42138#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42139#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:51,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {42139#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42139#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:51,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {42139#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42140#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:51,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {42140#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42140#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:51,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {42140#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42141#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:51,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {42141#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42141#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:51,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {42141#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42142#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:51,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {42142#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42142#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:51,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {42142#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42143#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:51,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {42143#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42143#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:51,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {42143#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42144#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:51,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {42144#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42144#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:51,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {42144#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42145#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:51,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {42145#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42145#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:51,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {42145#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42146#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:51,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {42146#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42146#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:51,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {42146#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42147#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:51,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {42147#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42147#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:51,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {42147#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42148#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:51,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {42148#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42148#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:51,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {42148#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42149#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:51,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {42149#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42149#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:51,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {42149#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42150#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:51,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {42150#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42150#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:51,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {42150#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42151#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:51,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {42151#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42151#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:51,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {42151#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42152#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:51,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {42152#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42152#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:51,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {42152#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42153#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:51,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {42153#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42153#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:51,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {42153#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42154#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:51,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {42154#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42154#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:51,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {42154#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42155#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:51,798 INFO L290 TraceCheckUtils]: 64: Hoare triple {42155#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42155#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:51,798 INFO L290 TraceCheckUtils]: 65: Hoare triple {42155#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42156#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:51,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {42156#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42156#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:51,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {42156#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42157#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:51,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {42157#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42157#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:51,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {42157#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42158#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:51,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {42158#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42158#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:51,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {42158#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42159#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:51,800 INFO L290 TraceCheckUtils]: 72: Hoare triple {42159#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42159#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:51,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {42159#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42160#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:51,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {42160#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42160#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:51,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {42160#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42161#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:51,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {42161#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42161#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:51,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {42161#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42162#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:51,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {42162#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42162#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:51,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {42162#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42163#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:51,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {42163#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42163#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:51,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {42163#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42164#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:51,803 INFO L290 TraceCheckUtils]: 82: Hoare triple {42164#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42164#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:51,804 INFO L290 TraceCheckUtils]: 83: Hoare triple {42164#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42165#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:51,804 INFO L290 TraceCheckUtils]: 84: Hoare triple {42165#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42165#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:51,804 INFO L290 TraceCheckUtils]: 85: Hoare triple {42165#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42166#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:51,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {42166#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42166#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:51,805 INFO L290 TraceCheckUtils]: 87: Hoare triple {42166#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42167#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:51,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {42167#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42167#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:51,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {42167#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42168#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:51,806 INFO L290 TraceCheckUtils]: 90: Hoare triple {42168#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42168#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:51,806 INFO L290 TraceCheckUtils]: 91: Hoare triple {42168#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42169#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:51,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {42169#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42169#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:51,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {42169#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42170#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:51,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {42170#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42170#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:51,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {42170#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42171#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:51,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {42171#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42171#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:51,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {42171#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42172#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:51,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {42172#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42172#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:51,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {42172#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42173#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:51,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {42173#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42173#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:51,809 INFO L290 TraceCheckUtils]: 101: Hoare triple {42173#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42174#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 102: Hoare triple {42174#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42174#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {42174#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42175#(<= main_~i~0 49)} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 104: Hoare triple {42175#(<= main_~i~0 49)} assume !(~i~0 < 1024); {42122#false} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 105: Hoare triple {42122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {42122#false} is VALID [2022-04-15 05:57:51,810 INFO L272 TraceCheckUtils]: 106: Hoare triple {42122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {42122#false} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 107: Hoare triple {42122#false} ~cond := #in~cond; {42122#false} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 108: Hoare triple {42122#false} assume 0 == ~cond; {42122#false} is VALID [2022-04-15 05:57:51,810 INFO L290 TraceCheckUtils]: 109: Hoare triple {42122#false} assume !false; {42122#false} is VALID [2022-04-15 05:57:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121453049] [2022-04-15 05:57:51,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121453049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181690890] [2022-04-15 05:57:51,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:51,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:51,812 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:57:51,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-15 05:57:52,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:52,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:52,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 05:57:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:52,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:52,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {42121#true} call ULTIMATE.init(); {42121#true} is VALID [2022-04-15 05:57:52,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {42121#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(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-15 05:57:52,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-15 05:57:52,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-15 05:57:52,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {42121#true} call #t~ret6 := main(); {42121#true} is VALID [2022-04-15 05:57:52,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {42121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {42195#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:52,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {42195#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42195#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:52,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {42195#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42127#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:52,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {42127#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42127#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:52,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {42127#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42128#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:52,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {42128#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42128#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:52,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {42128#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42129#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:52,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {42129#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42129#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:52,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {42129#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42130#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:52,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {42130#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42130#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:52,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {42130#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42131#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:52,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {42131#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42131#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:52,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {42131#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42132#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:52,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {42132#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42132#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:52,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {42132#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42133#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:52,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {42133#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42133#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:52,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {42133#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42134#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:52,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {42134#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42134#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:52,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {42134#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42135#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:52,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {42135#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42135#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:52,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {42135#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42136#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:52,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {42136#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42136#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:52,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {42136#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42137#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:52,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {42137#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42137#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:52,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {42137#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42138#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:52,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {42138#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42138#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:52,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {42138#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42139#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:52,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {42139#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42139#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:52,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {42139#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42140#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:52,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {42140#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42140#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:52,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {42140#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42141#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:52,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {42141#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42141#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:52,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {42141#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42142#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:52,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {42142#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42142#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:52,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {42142#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42143#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:52,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {42143#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42143#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:52,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {42143#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42144#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:52,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {42144#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42144#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:52,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {42144#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42145#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:52,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {42145#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42145#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:52,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {42145#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42146#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:52,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {42146#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42146#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:52,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {42146#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42147#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:52,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {42147#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42147#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:52,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {42147#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42148#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:52,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {42148#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42148#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:52,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {42148#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42149#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:52,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {42149#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42149#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:52,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {42149#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42150#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:52,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {42150#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42150#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:52,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {42150#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42151#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:52,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {42151#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42151#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:52,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {42151#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42152#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:52,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {42152#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42152#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:52,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {42152#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42153#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:52,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {42153#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42153#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:52,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {42153#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42154#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:52,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {42154#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42154#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:52,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {42154#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42155#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:52,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {42155#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42155#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:52,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {42155#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42156#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:52,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {42156#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42156#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:52,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {42156#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42157#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:52,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {42157#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42157#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:52,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {42157#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42158#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:52,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {42158#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42158#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:52,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {42158#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42159#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:52,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {42159#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42159#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:52,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {42159#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42160#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:52,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {42160#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42160#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:52,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {42160#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42161#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:52,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {42161#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42161#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:52,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {42161#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42162#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:52,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {42162#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42162#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:52,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {42162#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42163#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:52,774 INFO L290 TraceCheckUtils]: 80: Hoare triple {42163#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42163#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:52,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {42163#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42164#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:52,775 INFO L290 TraceCheckUtils]: 82: Hoare triple {42164#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42164#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:52,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {42164#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42165#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:52,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {42165#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42165#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:52,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {42165#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42166#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:52,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {42166#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42166#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:52,777 INFO L290 TraceCheckUtils]: 87: Hoare triple {42166#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42167#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:52,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {42167#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42167#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:52,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {42167#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42168#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:52,778 INFO L290 TraceCheckUtils]: 90: Hoare triple {42168#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42168#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:52,778 INFO L290 TraceCheckUtils]: 91: Hoare triple {42168#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42169#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:52,778 INFO L290 TraceCheckUtils]: 92: Hoare triple {42169#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42169#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:52,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {42169#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42170#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:52,779 INFO L290 TraceCheckUtils]: 94: Hoare triple {42170#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42170#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:52,779 INFO L290 TraceCheckUtils]: 95: Hoare triple {42170#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42171#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:52,779 INFO L290 TraceCheckUtils]: 96: Hoare triple {42171#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42171#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:52,780 INFO L290 TraceCheckUtils]: 97: Hoare triple {42171#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42172#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:52,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {42172#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42172#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:52,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {42172#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42173#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:52,781 INFO L290 TraceCheckUtils]: 100: Hoare triple {42173#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42173#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:52,781 INFO L290 TraceCheckUtils]: 101: Hoare triple {42173#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42174#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:52,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {42174#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42174#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:52,782 INFO L290 TraceCheckUtils]: 103: Hoare triple {42174#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42175#(<= main_~i~0 49)} is VALID [2022-04-15 05:57:52,782 INFO L290 TraceCheckUtils]: 104: Hoare triple {42175#(<= main_~i~0 49)} assume !(~i~0 < 1024); {42122#false} is VALID [2022-04-15 05:57:52,782 INFO L290 TraceCheckUtils]: 105: Hoare triple {42122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {42122#false} is VALID [2022-04-15 05:57:52,782 INFO L272 TraceCheckUtils]: 106: Hoare triple {42122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {42122#false} is VALID [2022-04-15 05:57:52,782 INFO L290 TraceCheckUtils]: 107: Hoare triple {42122#false} ~cond := #in~cond; {42122#false} is VALID [2022-04-15 05:57:52,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {42122#false} assume 0 == ~cond; {42122#false} is VALID [2022-04-15 05:57:52,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {42122#false} assume !false; {42122#false} is VALID [2022-04-15 05:57:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:52,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:55,749 INFO L290 TraceCheckUtils]: 109: Hoare triple {42122#false} assume !false; {42122#false} is VALID [2022-04-15 05:57:55,749 INFO L290 TraceCheckUtils]: 108: Hoare triple {42122#false} assume 0 == ~cond; {42122#false} is VALID [2022-04-15 05:57:55,749 INFO L290 TraceCheckUtils]: 107: Hoare triple {42122#false} ~cond := #in~cond; {42122#false} is VALID [2022-04-15 05:57:55,749 INFO L272 TraceCheckUtils]: 106: Hoare triple {42122#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {42122#false} is VALID [2022-04-15 05:57:55,749 INFO L290 TraceCheckUtils]: 105: Hoare triple {42122#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {42122#false} is VALID [2022-04-15 05:57:55,750 INFO L290 TraceCheckUtils]: 104: Hoare triple {42523#(< main_~i~0 1024)} assume !(~i~0 < 1024); {42122#false} is VALID [2022-04-15 05:57:55,750 INFO L290 TraceCheckUtils]: 103: Hoare triple {42527#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42523#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:55,750 INFO L290 TraceCheckUtils]: 102: Hoare triple {42527#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42527#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:55,751 INFO L290 TraceCheckUtils]: 101: Hoare triple {42534#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42527#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:55,751 INFO L290 TraceCheckUtils]: 100: Hoare triple {42534#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42534#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:55,751 INFO L290 TraceCheckUtils]: 99: Hoare triple {42541#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42534#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:55,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {42541#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42541#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:55,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {42548#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42541#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:55,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {42548#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42548#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:55,753 INFO L290 TraceCheckUtils]: 95: Hoare triple {42555#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42548#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:55,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {42555#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42555#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:55,753 INFO L290 TraceCheckUtils]: 93: Hoare triple {42562#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42555#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:55,753 INFO L290 TraceCheckUtils]: 92: Hoare triple {42562#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42562#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:55,754 INFO L290 TraceCheckUtils]: 91: Hoare triple {42569#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42562#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:55,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {42569#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42569#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:55,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {42576#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42569#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:55,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {42576#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42576#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:55,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {42583#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42576#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:55,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {42583#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42583#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:55,756 INFO L290 TraceCheckUtils]: 85: Hoare triple {42590#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42583#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:55,756 INFO L290 TraceCheckUtils]: 84: Hoare triple {42590#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42590#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:55,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {42597#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42590#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:55,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {42597#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42597#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:55,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {42604#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42597#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:55,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {42604#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42604#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:55,758 INFO L290 TraceCheckUtils]: 79: Hoare triple {42611#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42604#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:55,758 INFO L290 TraceCheckUtils]: 78: Hoare triple {42611#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42611#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:55,758 INFO L290 TraceCheckUtils]: 77: Hoare triple {42618#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42611#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:55,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {42618#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42618#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:55,759 INFO L290 TraceCheckUtils]: 75: Hoare triple {42625#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42618#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:55,759 INFO L290 TraceCheckUtils]: 74: Hoare triple {42625#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42625#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:55,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {42632#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42625#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:55,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {42632#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42632#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:55,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {42639#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42632#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:55,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {42639#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42639#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:55,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {42646#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42639#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:55,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {42646#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42646#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:55,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {42653#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42646#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:55,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {42653#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42653#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:55,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {42660#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42653#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:55,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {42660#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42660#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:55,763 INFO L290 TraceCheckUtils]: 63: Hoare triple {42667#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42660#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:55,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {42667#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42667#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:55,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {42674#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42667#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:55,763 INFO L290 TraceCheckUtils]: 60: Hoare triple {42674#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42674#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:55,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {42681#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42674#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:55,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {42681#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42681#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:55,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {42688#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42681#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:55,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {42688#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42688#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:55,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {42695#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42688#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:55,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {42695#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42695#(< main_~i~0 999)} is VALID [2022-04-15 05:57:55,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {42702#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42695#(< main_~i~0 999)} is VALID [2022-04-15 05:57:55,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {42702#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42702#(< main_~i~0 998)} is VALID [2022-04-15 05:57:55,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {42709#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42702#(< main_~i~0 998)} is VALID [2022-04-15 05:57:55,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {42709#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42709#(< main_~i~0 997)} is VALID [2022-04-15 05:57:55,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {42716#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42709#(< main_~i~0 997)} is VALID [2022-04-15 05:57:55,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {42716#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42716#(< main_~i~0 996)} is VALID [2022-04-15 05:57:55,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {42723#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42716#(< main_~i~0 996)} is VALID [2022-04-15 05:57:55,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {42723#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42723#(< main_~i~0 995)} is VALID [2022-04-15 05:57:55,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {42730#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42723#(< main_~i~0 995)} is VALID [2022-04-15 05:57:55,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {42730#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42730#(< main_~i~0 994)} is VALID [2022-04-15 05:57:55,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {42737#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42730#(< main_~i~0 994)} is VALID [2022-04-15 05:57:55,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {42737#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42737#(< main_~i~0 993)} is VALID [2022-04-15 05:57:55,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {42744#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42737#(< main_~i~0 993)} is VALID [2022-04-15 05:57:55,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {42744#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42744#(< main_~i~0 992)} is VALID [2022-04-15 05:57:55,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {42751#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42744#(< main_~i~0 992)} is VALID [2022-04-15 05:57:55,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {42751#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42751#(< main_~i~0 991)} is VALID [2022-04-15 05:57:55,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {42758#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42751#(< main_~i~0 991)} is VALID [2022-04-15 05:57:55,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {42758#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42758#(< main_~i~0 990)} is VALID [2022-04-15 05:57:55,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {42765#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42758#(< main_~i~0 990)} is VALID [2022-04-15 05:57:55,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {42765#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42765#(< main_~i~0 989)} is VALID [2022-04-15 05:57:55,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {42772#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42765#(< main_~i~0 989)} is VALID [2022-04-15 05:57:55,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {42772#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42772#(< main_~i~0 988)} is VALID [2022-04-15 05:57:55,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {42779#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42772#(< main_~i~0 988)} is VALID [2022-04-15 05:57:55,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {42779#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42779#(< main_~i~0 987)} is VALID [2022-04-15 05:57:55,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {42786#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42779#(< main_~i~0 987)} is VALID [2022-04-15 05:57:55,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {42786#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42786#(< main_~i~0 986)} is VALID [2022-04-15 05:57:55,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {42793#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42786#(< main_~i~0 986)} is VALID [2022-04-15 05:57:55,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {42793#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42793#(< main_~i~0 985)} is VALID [2022-04-15 05:57:55,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {42800#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42793#(< main_~i~0 985)} is VALID [2022-04-15 05:57:55,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {42800#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42800#(< main_~i~0 984)} is VALID [2022-04-15 05:57:55,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {42807#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42800#(< main_~i~0 984)} is VALID [2022-04-15 05:57:55,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {42807#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42807#(< main_~i~0 983)} is VALID [2022-04-15 05:57:55,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {42814#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42807#(< main_~i~0 983)} is VALID [2022-04-15 05:57:55,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {42814#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42814#(< main_~i~0 982)} is VALID [2022-04-15 05:57:55,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {42821#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42814#(< main_~i~0 982)} is VALID [2022-04-15 05:57:55,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {42821#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42821#(< main_~i~0 981)} is VALID [2022-04-15 05:57:55,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {42828#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42821#(< main_~i~0 981)} is VALID [2022-04-15 05:57:55,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {42828#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42828#(< main_~i~0 980)} is VALID [2022-04-15 05:57:55,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {42835#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42828#(< main_~i~0 980)} is VALID [2022-04-15 05:57:55,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {42835#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42835#(< main_~i~0 979)} is VALID [2022-04-15 05:57:55,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {42842#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42835#(< main_~i~0 979)} is VALID [2022-04-15 05:57:55,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {42842#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42842#(< main_~i~0 978)} is VALID [2022-04-15 05:57:55,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {42849#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42842#(< main_~i~0 978)} is VALID [2022-04-15 05:57:55,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {42849#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42849#(< main_~i~0 977)} is VALID [2022-04-15 05:57:55,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {42856#(< main_~i~0 976)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42849#(< main_~i~0 977)} is VALID [2022-04-15 05:57:55,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {42856#(< main_~i~0 976)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42856#(< main_~i~0 976)} is VALID [2022-04-15 05:57:55,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {42863#(< main_~i~0 975)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {42856#(< main_~i~0 976)} is VALID [2022-04-15 05:57:55,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {42863#(< main_~i~0 975)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42863#(< main_~i~0 975)} is VALID [2022-04-15 05:57:55,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {42121#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {42863#(< main_~i~0 975)} is VALID [2022-04-15 05:57:55,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {42121#true} call #t~ret6 := main(); {42121#true} is VALID [2022-04-15 05:57:55,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42121#true} {42121#true} #39#return; {42121#true} is VALID [2022-04-15 05:57:55,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {42121#true} assume true; {42121#true} is VALID [2022-04-15 05:57:55,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {42121#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(12, 2);call #Ultimate.allocInit(12, 3); {42121#true} is VALID [2022-04-15 05:57:55,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {42121#true} call ULTIMATE.init(); {42121#true} is VALID [2022-04-15 05:57:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:55,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181690890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:55,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:55,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 05:57:55,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:55,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213594867] [2022-04-15 05:57:55,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213594867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:55,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:55,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 05:57:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420355598] [2022-04-15 05:57:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 05:57:55,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:55,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:55,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:55,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 05:57:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 05:57:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 05:57:55,855 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:57,782 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-15 05:57:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 05:57:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 05:57:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-15 05:57:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-15 05:57:57,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 120 transitions. [2022-04-15 05:57:57,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:57,871 INFO L225 Difference]: With dead ends: 120 [2022-04-15 05:57:57,871 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 05:57:57,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 05:57:57,873 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:57,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 39 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:57:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 05:57:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-04-15 05:57:58,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:58,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:58,415 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:58,415 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:58,416 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-15 05:57:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-15 05:57:58,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:58,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:58,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-15 05:57:58,416 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-15 05:57:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:58,423 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-15 05:57:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-15 05:57:58,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:58,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:58,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:58,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2022-04-15 05:57:58,424 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2022-04-15 05:57:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:58,425 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2022-04-15 05:57:58,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:58,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 113 transitions. [2022-04-15 05:57:58,555 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-15 05:57:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-04-15 05:57:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 05:57:58,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:58,556 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:58,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:58,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 05:57:58,757 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 255839582, now seen corresponding path program 99 times [2022-04-15 05:57:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:58,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919107682] [2022-04-15 05:57:58,763 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:58,763 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:58,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash 255839582, now seen corresponding path program 100 times [2022-04-15 05:57:58,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:58,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336862683] [2022-04-15 05:57:58,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:58,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:59,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {43737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-15 05:57:59,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-15 05:57:59,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-15 05:57:59,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {43681#true} call ULTIMATE.init(); {43737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:59,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {43737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-15 05:57:59,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-15 05:57:59,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-15 05:57:59,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {43681#true} call #t~ret6 := main(); {43681#true} is VALID [2022-04-15 05:57:59,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {43681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {43686#(= main_~i~0 0)} is VALID [2022-04-15 05:57:59,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {43686#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43686#(= main_~i~0 0)} is VALID [2022-04-15 05:57:59,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {43686#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43687#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:59,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {43687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43687#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:59,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {43687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43688#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:59,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {43688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43688#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:59,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {43688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43689#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:59,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {43689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43689#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:59,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {43689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43690#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:59,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {43690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43690#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:59,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {43690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43691#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:59,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {43691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43691#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:59,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {43691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43692#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:59,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {43692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43692#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:59,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {43692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43693#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:59,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {43693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43693#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:59,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {43693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43694#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:59,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {43694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43694#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:59,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {43694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43695#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:59,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43695#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:59,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43696#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:59,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {43696#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43696#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:59,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {43696#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43697#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:59,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {43697#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43697#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:59,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {43697#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43698#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:59,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {43698#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43698#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:59,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {43698#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43699#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:59,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {43699#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43699#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:59,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {43699#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43700#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:59,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {43700#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43700#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:59,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {43700#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43701#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:59,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {43701#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43701#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:59,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {43701#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43702#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:59,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {43702#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43702#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:59,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {43702#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43703#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:59,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {43703#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43703#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:59,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {43703#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43704#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:59,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {43704#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43704#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:59,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {43704#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43705#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:59,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {43705#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43705#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:59,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {43705#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43706#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:59,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {43706#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43706#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:59,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {43706#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43707#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:59,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {43707#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43707#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:59,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {43707#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43708#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:59,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {43708#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43708#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:59,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {43708#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43709#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:59,831 INFO L290 TraceCheckUtils]: 52: Hoare triple {43709#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43709#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:59,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {43709#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43710#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:59,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {43710#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43710#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:59,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {43710#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43711#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:59,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {43711#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43711#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:59,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {43711#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43712#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:59,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {43712#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43712#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:59,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {43712#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43713#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:59,833 INFO L290 TraceCheckUtils]: 60: Hoare triple {43713#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43713#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:59,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {43713#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43714#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:59,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {43714#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43714#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:59,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {43714#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43715#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:59,835 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43715#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:59,835 INFO L290 TraceCheckUtils]: 65: Hoare triple {43715#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43716#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:59,835 INFO L290 TraceCheckUtils]: 66: Hoare triple {43716#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43716#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:59,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {43716#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43717#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:59,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {43717#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43717#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:59,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {43717#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43718#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:59,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {43718#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43718#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:59,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {43718#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43719#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:59,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {43719#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43719#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:59,837 INFO L290 TraceCheckUtils]: 73: Hoare triple {43719#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43720#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:59,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {43720#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43720#(<= main_~i~0 34)} is VALID [2022-04-15 05:57:59,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {43720#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43721#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:59,838 INFO L290 TraceCheckUtils]: 76: Hoare triple {43721#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43721#(<= main_~i~0 35)} is VALID [2022-04-15 05:57:59,839 INFO L290 TraceCheckUtils]: 77: Hoare triple {43721#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43722#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:59,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {43722#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43722#(<= main_~i~0 36)} is VALID [2022-04-15 05:57:59,839 INFO L290 TraceCheckUtils]: 79: Hoare triple {43722#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43723#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:59,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {43723#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43723#(<= main_~i~0 37)} is VALID [2022-04-15 05:57:59,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {43723#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43724#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:59,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {43724#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43724#(<= main_~i~0 38)} is VALID [2022-04-15 05:57:59,840 INFO L290 TraceCheckUtils]: 83: Hoare triple {43724#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43725#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:59,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {43725#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43725#(<= main_~i~0 39)} is VALID [2022-04-15 05:57:59,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {43725#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43726#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:59,841 INFO L290 TraceCheckUtils]: 86: Hoare triple {43726#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43726#(<= main_~i~0 40)} is VALID [2022-04-15 05:57:59,842 INFO L290 TraceCheckUtils]: 87: Hoare triple {43726#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43727#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:59,842 INFO L290 TraceCheckUtils]: 88: Hoare triple {43727#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43727#(<= main_~i~0 41)} is VALID [2022-04-15 05:57:59,842 INFO L290 TraceCheckUtils]: 89: Hoare triple {43727#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43728#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:59,843 INFO L290 TraceCheckUtils]: 90: Hoare triple {43728#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43728#(<= main_~i~0 42)} is VALID [2022-04-15 05:57:59,843 INFO L290 TraceCheckUtils]: 91: Hoare triple {43728#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43729#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:59,843 INFO L290 TraceCheckUtils]: 92: Hoare triple {43729#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43729#(<= main_~i~0 43)} is VALID [2022-04-15 05:57:59,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {43729#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43730#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:59,844 INFO L290 TraceCheckUtils]: 94: Hoare triple {43730#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43730#(<= main_~i~0 44)} is VALID [2022-04-15 05:57:59,844 INFO L290 TraceCheckUtils]: 95: Hoare triple {43730#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43731#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:59,844 INFO L290 TraceCheckUtils]: 96: Hoare triple {43731#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43731#(<= main_~i~0 45)} is VALID [2022-04-15 05:57:59,845 INFO L290 TraceCheckUtils]: 97: Hoare triple {43731#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43732#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:59,845 INFO L290 TraceCheckUtils]: 98: Hoare triple {43732#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43732#(<= main_~i~0 46)} is VALID [2022-04-15 05:57:59,845 INFO L290 TraceCheckUtils]: 99: Hoare triple {43732#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43733#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:59,846 INFO L290 TraceCheckUtils]: 100: Hoare triple {43733#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43733#(<= main_~i~0 47)} is VALID [2022-04-15 05:57:59,846 INFO L290 TraceCheckUtils]: 101: Hoare triple {43733#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43734#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:59,846 INFO L290 TraceCheckUtils]: 102: Hoare triple {43734#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43734#(<= main_~i~0 48)} is VALID [2022-04-15 05:57:59,847 INFO L290 TraceCheckUtils]: 103: Hoare triple {43734#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43735#(<= main_~i~0 49)} is VALID [2022-04-15 05:57:59,847 INFO L290 TraceCheckUtils]: 104: Hoare triple {43735#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43735#(<= main_~i~0 49)} is VALID [2022-04-15 05:57:59,847 INFO L290 TraceCheckUtils]: 105: Hoare triple {43735#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43736#(<= main_~i~0 50)} is VALID [2022-04-15 05:57:59,848 INFO L290 TraceCheckUtils]: 106: Hoare triple {43736#(<= main_~i~0 50)} assume !(~i~0 < 1024); {43682#false} is VALID [2022-04-15 05:57:59,848 INFO L290 TraceCheckUtils]: 107: Hoare triple {43682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {43682#false} is VALID [2022-04-15 05:57:59,848 INFO L272 TraceCheckUtils]: 108: Hoare triple {43682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {43682#false} is VALID [2022-04-15 05:57:59,848 INFO L290 TraceCheckUtils]: 109: Hoare triple {43682#false} ~cond := #in~cond; {43682#false} is VALID [2022-04-15 05:57:59,848 INFO L290 TraceCheckUtils]: 110: Hoare triple {43682#false} assume 0 == ~cond; {43682#false} is VALID [2022-04-15 05:57:59,848 INFO L290 TraceCheckUtils]: 111: Hoare triple {43682#false} assume !false; {43682#false} is VALID [2022-04-15 05:57:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:57:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:59,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336862683] [2022-04-15 05:57:59,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336862683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:59,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290655702] [2022-04-15 05:57:59,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:59,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:59,849 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:57:59,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-15 05:58:00,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:00,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:00,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 05:58:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:00,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:00,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {43681#true} call ULTIMATE.init(); {43681#true} is VALID [2022-04-15 05:58:00,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {43681#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(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-15 05:58:00,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-15 05:58:00,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-15 05:58:00,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {43681#true} call #t~ret6 := main(); {43681#true} is VALID [2022-04-15 05:58:00,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {43681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {43756#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:00,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {43756#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43756#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:00,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {43756#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43687#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:00,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {43687#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43687#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:00,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {43687#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43688#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:00,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {43688#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43688#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:00,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {43688#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43689#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:00,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {43689#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43689#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:00,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {43689#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43690#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:00,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {43690#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43690#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:00,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {43690#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43691#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:00,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {43691#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43691#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:00,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {43691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43692#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:00,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {43692#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43692#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:00,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {43692#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43693#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:00,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {43693#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43693#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:00,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {43693#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43694#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:00,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {43694#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43694#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:00,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {43694#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43695#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:00,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43695#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:00,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43696#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:00,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {43696#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43696#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:00,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {43696#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43697#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:00,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {43697#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43697#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:00,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {43697#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43698#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:00,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {43698#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43698#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:00,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {43698#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43699#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:00,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {43699#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43699#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:00,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {43699#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43700#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:00,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {43700#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43700#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:00,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {43700#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43701#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:00,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {43701#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43701#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:00,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {43701#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43702#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:00,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {43702#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43702#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:00,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {43702#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43703#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:00,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {43703#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43703#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:00,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {43703#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43704#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:00,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {43704#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43704#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:00,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {43704#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43705#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:00,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {43705#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43705#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:00,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {43705#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43706#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:00,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {43706#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43706#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:00,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {43706#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43707#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:00,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {43707#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43707#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:00,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {43707#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43708#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:00,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {43708#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43708#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:00,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {43708#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43709#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:00,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {43709#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43709#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:00,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {43709#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43710#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:00,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {43710#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43710#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:00,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {43710#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43711#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:00,809 INFO L290 TraceCheckUtils]: 56: Hoare triple {43711#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43711#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:00,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {43711#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43712#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:00,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {43712#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43712#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:00,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {43712#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43713#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:00,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {43713#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43713#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:00,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {43713#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43714#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:00,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {43714#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43714#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:00,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {43714#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43715#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:00,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43715#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:00,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {43715#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43716#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:00,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {43716#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43716#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:00,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {43716#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43717#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:00,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {43717#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43717#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:00,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {43717#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43718#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:00,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {43718#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43718#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:00,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {43718#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43719#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:00,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {43719#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43719#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:00,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {43719#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43720#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:00,815 INFO L290 TraceCheckUtils]: 74: Hoare triple {43720#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43720#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:00,815 INFO L290 TraceCheckUtils]: 75: Hoare triple {43720#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43721#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:00,815 INFO L290 TraceCheckUtils]: 76: Hoare triple {43721#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43721#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:00,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {43721#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43722#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:00,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {43722#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43722#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:00,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {43722#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43723#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:00,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {43723#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43723#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:00,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {43723#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43724#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:00,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {43724#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43724#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:00,817 INFO L290 TraceCheckUtils]: 83: Hoare triple {43724#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43725#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:00,818 INFO L290 TraceCheckUtils]: 84: Hoare triple {43725#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43725#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:00,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {43725#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43726#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:00,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {43726#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43726#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:00,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {43726#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43727#(<= main_~i~0 41)} is VALID [2022-04-15 05:58:00,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {43727#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43727#(<= main_~i~0 41)} is VALID [2022-04-15 05:58:00,819 INFO L290 TraceCheckUtils]: 89: Hoare triple {43727#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43728#(<= main_~i~0 42)} is VALID [2022-04-15 05:58:00,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {43728#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43728#(<= main_~i~0 42)} is VALID [2022-04-15 05:58:00,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {43728#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43729#(<= main_~i~0 43)} is VALID [2022-04-15 05:58:00,820 INFO L290 TraceCheckUtils]: 92: Hoare triple {43729#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43729#(<= main_~i~0 43)} is VALID [2022-04-15 05:58:00,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {43729#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43730#(<= main_~i~0 44)} is VALID [2022-04-15 05:58:00,821 INFO L290 TraceCheckUtils]: 94: Hoare triple {43730#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43730#(<= main_~i~0 44)} is VALID [2022-04-15 05:58:00,821 INFO L290 TraceCheckUtils]: 95: Hoare triple {43730#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43731#(<= main_~i~0 45)} is VALID [2022-04-15 05:58:00,821 INFO L290 TraceCheckUtils]: 96: Hoare triple {43731#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43731#(<= main_~i~0 45)} is VALID [2022-04-15 05:58:00,822 INFO L290 TraceCheckUtils]: 97: Hoare triple {43731#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43732#(<= main_~i~0 46)} is VALID [2022-04-15 05:58:00,822 INFO L290 TraceCheckUtils]: 98: Hoare triple {43732#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43732#(<= main_~i~0 46)} is VALID [2022-04-15 05:58:00,822 INFO L290 TraceCheckUtils]: 99: Hoare triple {43732#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43733#(<= main_~i~0 47)} is VALID [2022-04-15 05:58:00,823 INFO L290 TraceCheckUtils]: 100: Hoare triple {43733#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43733#(<= main_~i~0 47)} is VALID [2022-04-15 05:58:00,823 INFO L290 TraceCheckUtils]: 101: Hoare triple {43733#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43734#(<= main_~i~0 48)} is VALID [2022-04-15 05:58:00,823 INFO L290 TraceCheckUtils]: 102: Hoare triple {43734#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43734#(<= main_~i~0 48)} is VALID [2022-04-15 05:58:00,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {43734#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43735#(<= main_~i~0 49)} is VALID [2022-04-15 05:58:00,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {43735#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {43735#(<= main_~i~0 49)} is VALID [2022-04-15 05:58:00,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {43735#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {43736#(<= main_~i~0 50)} is VALID [2022-04-15 05:58:00,824 INFO L290 TraceCheckUtils]: 106: Hoare triple {43736#(<= main_~i~0 50)} assume !(~i~0 < 1024); {43682#false} is VALID [2022-04-15 05:58:00,825 INFO L290 TraceCheckUtils]: 107: Hoare triple {43682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {43682#false} is VALID [2022-04-15 05:58:00,825 INFO L272 TraceCheckUtils]: 108: Hoare triple {43682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {43682#false} is VALID [2022-04-15 05:58:00,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {43682#false} ~cond := #in~cond; {43682#false} is VALID [2022-04-15 05:58:00,825 INFO L290 TraceCheckUtils]: 110: Hoare triple {43682#false} assume 0 == ~cond; {43682#false} is VALID [2022-04-15 05:58:00,825 INFO L290 TraceCheckUtils]: 111: Hoare triple {43682#false} assume !false; {43682#false} is VALID [2022-04-15 05:58:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:58:00,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:03,913 INFO L290 TraceCheckUtils]: 111: Hoare triple {43682#false} assume !false; {43682#false} is VALID [2022-04-15 05:58:03,913 INFO L290 TraceCheckUtils]: 110: Hoare triple {43682#false} assume 0 == ~cond; {43682#false} is VALID [2022-04-15 05:58:03,913 INFO L290 TraceCheckUtils]: 109: Hoare triple {43682#false} ~cond := #in~cond; {43682#false} is VALID [2022-04-15 05:58:03,913 INFO L272 TraceCheckUtils]: 108: Hoare triple {43682#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {43682#false} is VALID [2022-04-15 05:58:03,913 INFO L290 TraceCheckUtils]: 107: Hoare triple {43682#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {43682#false} is VALID [2022-04-15 05:58:03,913 INFO L290 TraceCheckUtils]: 106: Hoare triple {44090#(< main_~i~0 1024)} assume !(~i~0 < 1024); {43682#false} is VALID [2022-04-15 05:58:03,914 INFO L290 TraceCheckUtils]: 105: Hoare triple {44094#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44090#(< main_~i~0 1024)} is VALID [2022-04-15 05:58:03,914 INFO L290 TraceCheckUtils]: 104: Hoare triple {44094#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44094#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:03,914 INFO L290 TraceCheckUtils]: 103: Hoare triple {44101#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44094#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:03,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {44101#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44101#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:03,915 INFO L290 TraceCheckUtils]: 101: Hoare triple {44108#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44101#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:03,915 INFO L290 TraceCheckUtils]: 100: Hoare triple {44108#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44108#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:03,916 INFO L290 TraceCheckUtils]: 99: Hoare triple {44115#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44108#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:03,916 INFO L290 TraceCheckUtils]: 98: Hoare triple {44115#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44115#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:03,916 INFO L290 TraceCheckUtils]: 97: Hoare triple {44122#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44115#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:03,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {44122#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44122#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:03,917 INFO L290 TraceCheckUtils]: 95: Hoare triple {44129#(< main_~i~0 1018)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44122#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:03,917 INFO L290 TraceCheckUtils]: 94: Hoare triple {44129#(< main_~i~0 1018)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44129#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:03,918 INFO L290 TraceCheckUtils]: 93: Hoare triple {44136#(< main_~i~0 1017)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44129#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:03,918 INFO L290 TraceCheckUtils]: 92: Hoare triple {44136#(< main_~i~0 1017)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44136#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:03,918 INFO L290 TraceCheckUtils]: 91: Hoare triple {44143#(< main_~i~0 1016)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44136#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:03,918 INFO L290 TraceCheckUtils]: 90: Hoare triple {44143#(< main_~i~0 1016)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44143#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:03,919 INFO L290 TraceCheckUtils]: 89: Hoare triple {44150#(< main_~i~0 1015)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44143#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:03,919 INFO L290 TraceCheckUtils]: 88: Hoare triple {44150#(< main_~i~0 1015)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44150#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:03,919 INFO L290 TraceCheckUtils]: 87: Hoare triple {44157#(< main_~i~0 1014)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44150#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:03,920 INFO L290 TraceCheckUtils]: 86: Hoare triple {44157#(< main_~i~0 1014)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44157#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:03,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {44164#(< main_~i~0 1013)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44157#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:03,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {44164#(< main_~i~0 1013)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44164#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:03,921 INFO L290 TraceCheckUtils]: 83: Hoare triple {44171#(< main_~i~0 1012)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44164#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:03,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {44171#(< main_~i~0 1012)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44171#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:03,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {44178#(< main_~i~0 1011)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44171#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:03,922 INFO L290 TraceCheckUtils]: 80: Hoare triple {44178#(< main_~i~0 1011)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44178#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:03,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {44185#(< main_~i~0 1010)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44178#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:03,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {44185#(< main_~i~0 1010)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44185#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:03,923 INFO L290 TraceCheckUtils]: 77: Hoare triple {44192#(< main_~i~0 1009)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44185#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:03,923 INFO L290 TraceCheckUtils]: 76: Hoare triple {44192#(< main_~i~0 1009)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44192#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:03,923 INFO L290 TraceCheckUtils]: 75: Hoare triple {44199#(< main_~i~0 1008)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44192#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:03,923 INFO L290 TraceCheckUtils]: 74: Hoare triple {44199#(< main_~i~0 1008)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44199#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:03,924 INFO L290 TraceCheckUtils]: 73: Hoare triple {44206#(< main_~i~0 1007)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44199#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:03,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {44206#(< main_~i~0 1007)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44206#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:03,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {44213#(< main_~i~0 1006)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44206#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:03,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {44213#(< main_~i~0 1006)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44213#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:03,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {44220#(< main_~i~0 1005)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44213#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:03,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {44220#(< main_~i~0 1005)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44220#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:03,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {44227#(< main_~i~0 1004)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44220#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:03,926 INFO L290 TraceCheckUtils]: 66: Hoare triple {44227#(< main_~i~0 1004)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44227#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:03,926 INFO L290 TraceCheckUtils]: 65: Hoare triple {44234#(< main_~i~0 1003)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44227#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:03,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {44234#(< main_~i~0 1003)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44234#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:03,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {44241#(< main_~i~0 1002)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44234#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:03,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {44241#(< main_~i~0 1002)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44241#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:03,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {44248#(< main_~i~0 1001)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44241#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:03,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {44248#(< main_~i~0 1001)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44248#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:03,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {44255#(< main_~i~0 1000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44248#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:03,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {44255#(< main_~i~0 1000)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44255#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:03,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {44262#(< main_~i~0 999)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44255#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:03,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {44262#(< main_~i~0 999)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44262#(< main_~i~0 999)} is VALID [2022-04-15 05:58:03,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {44269#(< main_~i~0 998)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44262#(< main_~i~0 999)} is VALID [2022-04-15 05:58:03,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {44269#(< main_~i~0 998)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44269#(< main_~i~0 998)} is VALID [2022-04-15 05:58:03,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {44276#(< main_~i~0 997)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44269#(< main_~i~0 998)} is VALID [2022-04-15 05:58:03,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {44276#(< main_~i~0 997)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44276#(< main_~i~0 997)} is VALID [2022-04-15 05:58:03,931 INFO L290 TraceCheckUtils]: 51: Hoare triple {44283#(< main_~i~0 996)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44276#(< main_~i~0 997)} is VALID [2022-04-15 05:58:03,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {44283#(< main_~i~0 996)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44283#(< main_~i~0 996)} is VALID [2022-04-15 05:58:03,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {44290#(< main_~i~0 995)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44283#(< main_~i~0 996)} is VALID [2022-04-15 05:58:03,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {44290#(< main_~i~0 995)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44290#(< main_~i~0 995)} is VALID [2022-04-15 05:58:03,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {44297#(< main_~i~0 994)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44290#(< main_~i~0 995)} is VALID [2022-04-15 05:58:03,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {44297#(< main_~i~0 994)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44297#(< main_~i~0 994)} is VALID [2022-04-15 05:58:03,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {44304#(< main_~i~0 993)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44297#(< main_~i~0 994)} is VALID [2022-04-15 05:58:03,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {44304#(< main_~i~0 993)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44304#(< main_~i~0 993)} is VALID [2022-04-15 05:58:03,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {44311#(< main_~i~0 992)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44304#(< main_~i~0 993)} is VALID [2022-04-15 05:58:03,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {44311#(< main_~i~0 992)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44311#(< main_~i~0 992)} is VALID [2022-04-15 05:58:03,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {44318#(< main_~i~0 991)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44311#(< main_~i~0 992)} is VALID [2022-04-15 05:58:03,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {44318#(< main_~i~0 991)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44318#(< main_~i~0 991)} is VALID [2022-04-15 05:58:03,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {44325#(< main_~i~0 990)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44318#(< main_~i~0 991)} is VALID [2022-04-15 05:58:03,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {44325#(< main_~i~0 990)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44325#(< main_~i~0 990)} is VALID [2022-04-15 05:58:03,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {44332#(< main_~i~0 989)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44325#(< main_~i~0 990)} is VALID [2022-04-15 05:58:03,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {44332#(< main_~i~0 989)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44332#(< main_~i~0 989)} is VALID [2022-04-15 05:58:03,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {44339#(< main_~i~0 988)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44332#(< main_~i~0 989)} is VALID [2022-04-15 05:58:03,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {44339#(< main_~i~0 988)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44339#(< main_~i~0 988)} is VALID [2022-04-15 05:58:03,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {44346#(< main_~i~0 987)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44339#(< main_~i~0 988)} is VALID [2022-04-15 05:58:03,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {44346#(< main_~i~0 987)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44346#(< main_~i~0 987)} is VALID [2022-04-15 05:58:03,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {44353#(< main_~i~0 986)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44346#(< main_~i~0 987)} is VALID [2022-04-15 05:58:03,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {44353#(< main_~i~0 986)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44353#(< main_~i~0 986)} is VALID [2022-04-15 05:58:03,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#(< main_~i~0 985)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44353#(< main_~i~0 986)} is VALID [2022-04-15 05:58:03,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#(< main_~i~0 985)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44360#(< main_~i~0 985)} is VALID [2022-04-15 05:58:03,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {44367#(< main_~i~0 984)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44360#(< main_~i~0 985)} is VALID [2022-04-15 05:58:03,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {44367#(< main_~i~0 984)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44367#(< main_~i~0 984)} is VALID [2022-04-15 05:58:03,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {44374#(< main_~i~0 983)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44367#(< main_~i~0 984)} is VALID [2022-04-15 05:58:03,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {44374#(< main_~i~0 983)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44374#(< main_~i~0 983)} is VALID [2022-04-15 05:58:03,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {44381#(< main_~i~0 982)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44374#(< main_~i~0 983)} is VALID [2022-04-15 05:58:03,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {44381#(< main_~i~0 982)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44381#(< main_~i~0 982)} is VALID [2022-04-15 05:58:03,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {44388#(< main_~i~0 981)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44381#(< main_~i~0 982)} is VALID [2022-04-15 05:58:03,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {44388#(< main_~i~0 981)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44388#(< main_~i~0 981)} is VALID [2022-04-15 05:58:03,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {44395#(< main_~i~0 980)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44388#(< main_~i~0 981)} is VALID [2022-04-15 05:58:03,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {44395#(< main_~i~0 980)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44395#(< main_~i~0 980)} is VALID [2022-04-15 05:58:03,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {44402#(< main_~i~0 979)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44395#(< main_~i~0 980)} is VALID [2022-04-15 05:58:03,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {44402#(< main_~i~0 979)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44402#(< main_~i~0 979)} is VALID [2022-04-15 05:58:03,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {44409#(< main_~i~0 978)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44402#(< main_~i~0 979)} is VALID [2022-04-15 05:58:03,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {44409#(< main_~i~0 978)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44409#(< main_~i~0 978)} is VALID [2022-04-15 05:58:03,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {44416#(< main_~i~0 977)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44409#(< main_~i~0 978)} is VALID [2022-04-15 05:58:03,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {44416#(< main_~i~0 977)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44416#(< main_~i~0 977)} is VALID [2022-04-15 05:58:03,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(< main_~i~0 976)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44416#(< main_~i~0 977)} is VALID [2022-04-15 05:58:03,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(< main_~i~0 976)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44423#(< main_~i~0 976)} is VALID [2022-04-15 05:58:03,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {44430#(< main_~i~0 975)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44423#(< main_~i~0 976)} is VALID [2022-04-15 05:58:03,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {44430#(< main_~i~0 975)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44430#(< main_~i~0 975)} is VALID [2022-04-15 05:58:03,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {44437#(< main_~i~0 974)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {44430#(< main_~i~0 975)} is VALID [2022-04-15 05:58:03,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {44437#(< main_~i~0 974)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44437#(< main_~i~0 974)} is VALID [2022-04-15 05:58:03,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {43681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {44437#(< main_~i~0 974)} is VALID [2022-04-15 05:58:03,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {43681#true} call #t~ret6 := main(); {43681#true} is VALID [2022-04-15 05:58:03,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43681#true} {43681#true} #39#return; {43681#true} is VALID [2022-04-15 05:58:03,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {43681#true} assume true; {43681#true} is VALID [2022-04-15 05:58:03,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {43681#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(12, 2);call #Ultimate.allocInit(12, 3); {43681#true} is VALID [2022-04-15 05:58:03,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {43681#true} call ULTIMATE.init(); {43681#true} is VALID [2022-04-15 05:58:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:58:03,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290655702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:03,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:03,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-15 05:58:03,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:03,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919107682] [2022-04-15 05:58:03,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919107682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:03,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:03,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 05:58:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095996594] [2022-04-15 05:58:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 05:58:03,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:03,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:04,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:04,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 05:58:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 05:58:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 05:58:04,023 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:05,998 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-15 05:58:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 05:58:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 05:58:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-15 05:58:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-15 05:58:05,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 122 transitions. [2022-04-15 05:58:06,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:06,089 INFO L225 Difference]: With dead ends: 122 [2022-04-15 05:58:06,089 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 05:58:06,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10818, Invalid=13674, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 05:58:06,091 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:06,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 24 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:58:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 05:58:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-15 05:58:06,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:06,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:06,684 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:06,684 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:06,685 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-15 05:58:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-15 05:58:06,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:06,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:06,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-15 05:58:06,685 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-15 05:58:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:06,686 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-15 05:58:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-15 05:58:06,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:06,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:06,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:06,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2022-04-15 05:58:06,688 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2022-04-15 05:58:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:06,688 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2022-04-15 05:58:06,688 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:06,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 115 transitions. [2022-04-15 05:58:06,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2022-04-15 05:58:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 05:58:06,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:06,823 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:06,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-15 05:58:07,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-04-15 05:58:07,027 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 174614880, now seen corresponding path program 101 times [2022-04-15 05:58:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:07,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920417266] [2022-04-15 05:58:07,033 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:07,033 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:07,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 174614880, now seen corresponding path program 102 times [2022-04-15 05:58:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:07,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622517784] [2022-04-15 05:58:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:08,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {45326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {45269#true} is VALID [2022-04-15 05:58:08,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {45269#true} assume true; {45269#true} is VALID [2022-04-15 05:58:08,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45269#true} {45269#true} #39#return; {45269#true} is VALID [2022-04-15 05:58:08,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {45269#true} call ULTIMATE.init(); {45326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:08,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {45326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {45269#true} is VALID [2022-04-15 05:58:08,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {45269#true} assume true; {45269#true} is VALID [2022-04-15 05:58:08,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45269#true} {45269#true} #39#return; {45269#true} is VALID [2022-04-15 05:58:08,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {45269#true} call #t~ret6 := main(); {45269#true} is VALID [2022-04-15 05:58:08,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {45269#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {45274#(= main_~i~0 0)} is VALID [2022-04-15 05:58:08,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {45274#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45274#(= main_~i~0 0)} is VALID [2022-04-15 05:58:08,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {45274#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45275#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:08,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {45275#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45275#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:08,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {45275#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45276#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:08,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {45276#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45276#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:08,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {45276#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45277#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:08,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {45277#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45277#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:08,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {45277#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45278#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:08,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {45278#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45278#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:08,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {45278#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45279#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:08,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {45279#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45279#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:08,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {45279#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45280#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:08,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {45280#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45280#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:08,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {45280#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45281#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:08,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {45281#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45281#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:08,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {45281#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45282#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:08,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {45282#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45282#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:08,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {45282#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45283#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:08,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {45283#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45283#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:08,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {45283#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45284#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:08,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {45284#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45284#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:08,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {45284#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45285#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:08,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {45285#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45285#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:08,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {45285#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45286#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:08,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {45286#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45286#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:08,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {45286#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45287#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:08,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {45287#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45287#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:08,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {45287#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45288#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:08,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {45288#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45288#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:08,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {45288#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45289#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:08,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {45289#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45289#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:08,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {45289#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45290#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:08,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {45290#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45290#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:08,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {45290#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45291#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:08,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {45291#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45291#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:08,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {45291#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45292#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:08,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {45292#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45292#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:08,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {45292#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45293#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:08,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {45293#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45293#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:08,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {45293#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45294#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:08,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {45294#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45294#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:08,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {45294#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45295#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:08,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {45295#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45295#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:08,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {45295#(<= main_~i~0 21)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45296#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:08,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {45296#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45296#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:08,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {45296#(<= main_~i~0 22)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45297#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:08,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {45297#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45297#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:08,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {45297#(<= main_~i~0 23)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45298#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:08,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {45298#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45298#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:08,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {45298#(<= main_~i~0 24)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45299#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:08,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {45299#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45299#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:08,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {45299#(<= main_~i~0 25)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45300#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:08,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {45300#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45300#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:08,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {45300#(<= main_~i~0 26)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45301#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:08,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {45301#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45301#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:08,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {45301#(<= main_~i~0 27)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45302#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:08,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {45302#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45302#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:08,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {45302#(<= main_~i~0 28)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45303#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:08,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {45303#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45303#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:08,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {45303#(<= main_~i~0 29)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45304#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:08,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {45304#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45304#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:08,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {45304#(<= main_~i~0 30)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45305#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:08,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {45305#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45305#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:08,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {45305#(<= main_~i~0 31)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45306#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:08,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {45306#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45306#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:08,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {45306#(<= main_~i~0 32)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45307#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:08,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {45307#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45307#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:08,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {45307#(<= main_~i~0 33)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45308#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:08,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {45308#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45308#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:08,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {45308#(<= main_~i~0 34)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45309#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:08,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {45309#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45309#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:08,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {45309#(<= main_~i~0 35)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45310#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:08,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {45310#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45310#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:08,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {45310#(<= main_~i~0 36)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45311#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:08,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {45311#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45311#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:08,200 INFO L290 TraceCheckUtils]: 81: Hoare triple {45311#(<= main_~i~0 37)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45312#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:08,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {45312#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45312#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:08,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {45312#(<= main_~i~0 38)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45313#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:08,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {45313#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45313#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:08,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {45313#(<= main_~i~0 39)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45314#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:08,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {45314#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45314#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:08,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {45314#(<= main_~i~0 40)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45315#(<= main_~i~0 41)} is VALID [2022-04-15 05:58:08,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {45315#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45315#(<= main_~i~0 41)} is VALID [2022-04-15 05:58:08,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {45315#(<= main_~i~0 41)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45316#(<= main_~i~0 42)} is VALID [2022-04-15 05:58:08,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {45316#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45316#(<= main_~i~0 42)} is VALID [2022-04-15 05:58:08,204 INFO L290 TraceCheckUtils]: 91: Hoare triple {45316#(<= main_~i~0 42)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45317#(<= main_~i~0 43)} is VALID [2022-04-15 05:58:08,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {45317#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45317#(<= main_~i~0 43)} is VALID [2022-04-15 05:58:08,204 INFO L290 TraceCheckUtils]: 93: Hoare triple {45317#(<= main_~i~0 43)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45318#(<= main_~i~0 44)} is VALID [2022-04-15 05:58:08,204 INFO L290 TraceCheckUtils]: 94: Hoare triple {45318#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45318#(<= main_~i~0 44)} is VALID [2022-04-15 05:58:08,205 INFO L290 TraceCheckUtils]: 95: Hoare triple {45318#(<= main_~i~0 44)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45319#(<= main_~i~0 45)} is VALID [2022-04-15 05:58:08,205 INFO L290 TraceCheckUtils]: 96: Hoare triple {45319#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45319#(<= main_~i~0 45)} is VALID [2022-04-15 05:58:08,205 INFO L290 TraceCheckUtils]: 97: Hoare triple {45319#(<= main_~i~0 45)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45320#(<= main_~i~0 46)} is VALID [2022-04-15 05:58:08,206 INFO L290 TraceCheckUtils]: 98: Hoare triple {45320#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45320#(<= main_~i~0 46)} is VALID [2022-04-15 05:58:08,206 INFO L290 TraceCheckUtils]: 99: Hoare triple {45320#(<= main_~i~0 46)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45321#(<= main_~i~0 47)} is VALID [2022-04-15 05:58:08,206 INFO L290 TraceCheckUtils]: 100: Hoare triple {45321#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45321#(<= main_~i~0 47)} is VALID [2022-04-15 05:58:08,207 INFO L290 TraceCheckUtils]: 101: Hoare triple {45321#(<= main_~i~0 47)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45322#(<= main_~i~0 48)} is VALID [2022-04-15 05:58:08,207 INFO L290 TraceCheckUtils]: 102: Hoare triple {45322#(<= main_~i~0 48)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45322#(<= main_~i~0 48)} is VALID [2022-04-15 05:58:08,207 INFO L290 TraceCheckUtils]: 103: Hoare triple {45322#(<= main_~i~0 48)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45323#(<= main_~i~0 49)} is VALID [2022-04-15 05:58:08,207 INFO L290 TraceCheckUtils]: 104: Hoare triple {45323#(<= main_~i~0 49)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45323#(<= main_~i~0 49)} is VALID [2022-04-15 05:58:08,208 INFO L290 TraceCheckUtils]: 105: Hoare triple {45323#(<= main_~i~0 49)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45324#(<= main_~i~0 50)} is VALID [2022-04-15 05:58:08,208 INFO L290 TraceCheckUtils]: 106: Hoare triple {45324#(<= main_~i~0 50)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {45324#(<= main_~i~0 50)} is VALID [2022-04-15 05:58:08,208 INFO L290 TraceCheckUtils]: 107: Hoare triple {45324#(<= main_~i~0 50)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {45325#(<= main_~i~0 51)} is VALID [2022-04-15 05:58:08,209 INFO L290 TraceCheckUtils]: 108: Hoare triple {45325#(<= main_~i~0 51)} assume !(~i~0 < 1024); {45270#false} is VALID [2022-04-15 05:58:08,209 INFO L290 TraceCheckUtils]: 109: Hoare triple {45270#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {45270#false} is VALID [2022-04-15 05:58:08,209 INFO L272 TraceCheckUtils]: 110: Hoare triple {45270#false} call __VERIFIER_assert((if 1023 != #t~mem5 then 1 else 0)); {45270#false} is VALID [2022-04-15 05:58:08,209 INFO L290 TraceCheckUtils]: 111: Hoare triple {45270#false} ~cond := #in~cond; {45270#false} is VALID [2022-04-15 05:58:08,209 INFO L290 TraceCheckUtils]: 112: Hoare triple {45270#false} assume 0 == ~cond; {45270#false} is VALID [2022-04-15 05:58:08,209 INFO L290 TraceCheckUtils]: 113: Hoare triple {45270#false} assume !false; {45270#false} is VALID [2022-04-15 05:58:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:58:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:08,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622517784] [2022-04-15 05:58:08,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622517784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:08,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499129882] [2022-04-15 05:58:08,210 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:58:08,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:08,211 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:58:08,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process