/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:29,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:29,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:29,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:29,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:29,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:29,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:29,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:29,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:29,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:29,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:29,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:29,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:29,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:29,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:29,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:29,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:29,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:29,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:29,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:29,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:29,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:29,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:29,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:29,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:29,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:29,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:29,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:29,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:29,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:29,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:29,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:29,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:29,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:29,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:29,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:29,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:29,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:29,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:29,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:29,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:29,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:29,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:29,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:29,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:29,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:29,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:29,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:29,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:29,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:29,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:29,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:29,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:29,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:29,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:29,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:29,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:29,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:29,071 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:29,071 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:29,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:29,072 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:29,072 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:41:29,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:29,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:29,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:29,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:29,266 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:29,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-1.c [2022-04-28 02:41:29,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6077edc49/c168a4f907f74038acacc610d408c3b2/FLAG35c5e525e [2022-04-28 02:41:29,627 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:29,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c [2022-04-28 02:41:29,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6077edc49/c168a4f907f74038acacc610d408c3b2/FLAG35c5e525e [2022-04-28 02:41:30,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6077edc49/c168a4f907f74038acacc610d408c3b2 [2022-04-28 02:41:30,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:30,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:30,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:30,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:30,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:30,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533b7fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30, skipping insertion in model container [2022-04-28 02:41:30,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:30,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:30,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c[328,341] [2022-04-28 02:41:30,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:30,269 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:30,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c[328,341] [2022-04-28 02:41:30,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:30,292 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:30,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30 WrapperNode [2022-04-28 02:41:30,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:30,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:30,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:30,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:30,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:30,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:30,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:30,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:30,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:30,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:41:30,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:41:30,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:30,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:30,392 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:30,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:41:30,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:30,442 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:30,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:30,724 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:30,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:30,729 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 02:41:30,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:30 BoogieIcfgContainer [2022-04-28 02:41:30,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:30,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:30,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:30,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:30,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:30" (1/3) ... [2022-04-28 02:41:30,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:30, skipping insertion in model container [2022-04-28 02:41:30,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (2/3) ... [2022-04-28 02:41:30,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:30, skipping insertion in model container [2022-04-28 02:41:30,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:30" (3/3) ... [2022-04-28 02:41:30,760 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2022-04-28 02:41:30,786 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:30,786 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:30,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:30,827 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66d81776, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35998887 [2022-04-28 02:41:30,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 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-28 02:41:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:41:30,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:30,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:30,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1898607287, now seen corresponding path program 1 times [2022-04-28 02:41:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:30,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [19726876] [2022-04-28 02:41:30,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1898607287, now seen corresponding path program 2 times [2022-04-28 02:41:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:30,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571240912] [2022-04-28 02:41:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(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(19, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-28 02:41:31,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 02:41:31,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #94#return; {36#true} is VALID [2022-04-28 02:41:31,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:31,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(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(19, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-28 02:41:31,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 02:41:31,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #94#return; {36#true} is VALID [2022-04-28 02:41:31,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret15 := main(); {36#true} is VALID [2022-04-28 02:41:31,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {41#(= main_~j~0 0)} is VALID [2022-04-28 02:41:31,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:31,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:31,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:31,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:31,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {37#false} is VALID [2022-04-28 02:41:31,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {37#false} is VALID [2022-04-28 02:41:31,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-28 02:41:31,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-28 02:41:31,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 02:41:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571240912] [2022-04-28 02:41:31,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571240912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:31,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:31,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:31,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:31,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [19726876] [2022-04-28 02:41:31,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [19726876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:31,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:31,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739524609] [2022-04-28 02:41:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:31,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 02:41:31,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:31,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:31,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:31,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:41:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:41:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:41:31,177 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,460 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-28 02:41:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:41:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 02:41:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-04-28 02:41:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-04-28 02:41:31,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2022-04-28 02:41:31,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:31,563 INFO L225 Difference]: With dead ends: 67 [2022-04-28 02:41:31,563 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:41:31,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:41:31,569 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:31,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 47 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:41:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 02:41:31,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:31,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:31,596 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:31,596 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,601 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 02:41:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 02:41:31,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:31,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:31,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 02:41:31,603 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 02:41:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,607 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 02:41:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 02:41:31,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:31,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:31,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:31,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-28 02:41:31,614 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2022-04-28 02:41:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:31,616 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-28 02:41:31,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:31,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-28 02:41:31,654 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-28 02:41:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 02:41:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:41:31,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:31,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:31,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:31,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1409532089, now seen corresponding path program 1 times [2022-04-28 02:41:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:31,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953614715] [2022-04-28 02:41:31,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:31,669 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:31,669 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:31,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1409532089, now seen corresponding path program 2 times [2022-04-28 02:41:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:31,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597849599] [2022-04-28 02:41:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(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(19, 2);call #Ultimate.allocInit(12, 3); {304#true} is VALID [2022-04-28 02:41:31,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:31,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #94#return; {304#true} is VALID [2022-04-28 02:41:31,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:31,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(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(19, 2);call #Ultimate.allocInit(12, 3); {304#true} is VALID [2022-04-28 02:41:31,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:31,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #94#return; {304#true} is VALID [2022-04-28 02:41:31,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret15 := main(); {304#true} is VALID [2022-04-28 02:41:31,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {309#(= main_~j~0 0)} is VALID [2022-04-28 02:41:31,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {309#(= main_~j~0 0)} is VALID [2022-04-28 02:41:31,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {310#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:31,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:31,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:31,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:31,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {312#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 02:41:31,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {305#false} is VALID [2022-04-28 02:41:31,780 INFO L272 TraceCheckUtils]: 13: Hoare triple {305#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {305#false} is VALID [2022-04-28 02:41:31,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} ~cond := #in~cond; {305#false} is VALID [2022-04-28 02:41:31,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#false} assume 0 == ~cond; {305#false} is VALID [2022-04-28 02:41:31,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-28 02:41:31,781 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-28 02:41:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597849599] [2022-04-28 02:41:31,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597849599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237028245] [2022-04-28 02:41:31,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:31,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:31,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:31,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:41:31,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 02:41:31,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:31,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:41:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:32,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2022-04-28 02:41:32,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {304#true} is VALID [2022-04-28 02:41:32,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2022-04-28 02:41:32,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #94#return; {304#true} is VALID [2022-04-28 02:41:32,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret15 := main(); {304#true} is VALID [2022-04-28 02:41:32,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {304#true} is VALID [2022-04-28 02:41:32,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {304#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {304#true} is VALID [2022-04-28 02:41:32,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {304#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {304#true} is VALID [2022-04-28 02:41:32,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {304#true} is VALID [2022-04-28 02:41:32,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {304#true} ~j~0 := 1; {310#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:32,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:32,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {312#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 02:41:32,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {305#false} is VALID [2022-04-28 02:41:32,325 INFO L272 TraceCheckUtils]: 13: Hoare triple {305#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {305#false} is VALID [2022-04-28 02:41:32,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} ~cond := #in~cond; {305#false} is VALID [2022-04-28 02:41:32,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#false} assume 0 == ~cond; {305#false} is VALID [2022-04-28 02:41:32,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-04-28 02:41:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:32,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:41:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237028245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:32,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 02:41:32,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-04-28 02:41:32,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:32,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953614715] [2022-04-28 02:41:32,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953614715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:32,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:32,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362936746] [2022-04-28 02:41:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:32,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:41:32,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:32,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:32,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:32,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:41:32,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:32,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:41:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:41:32,342 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,494 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 02:41:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:41:32,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:41:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-28 02:41:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-28 02:41:32,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-28 02:41:32,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:32,551 INFO L225 Difference]: With dead ends: 49 [2022-04-28 02:41:32,551 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 02:41:32,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:41:32,553 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:32,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 02:41:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-28 02:41:32,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:32,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:32,565 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:32,565 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,567 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 02:41:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 02:41:32,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:32,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:32,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-28 02:41:32,568 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-28 02:41:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,569 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 02:41:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 02:41:32,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:32,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:32,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:32,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-28 02:41:32,571 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 17 [2022-04-28 02:41:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:32,571 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-28 02:41:32,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:32,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-28 02:41:32,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 02:41:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:41:32,599 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:32,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:32,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 02:41:32,815 WARN L477 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-28 02:41:32,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1131787334, now seen corresponding path program 1 times [2022-04-28 02:41:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:32,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319462882] [2022-04-28 02:41:32,822 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:32,822 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:32,822 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1131787334, now seen corresponding path program 2 times [2022-04-28 02:41:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:32,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692580023] [2022-04-28 02:41:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {610#(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(19, 2);call #Ultimate.allocInit(12, 3); {600#true} is VALID [2022-04-28 02:41:32,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-28 02:41:32,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {600#true} {600#true} #94#return; {600#true} is VALID [2022-04-28 02:41:32,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {600#true} call ULTIMATE.init(); {610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:32,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#(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(19, 2);call #Ultimate.allocInit(12, 3); {600#true} is VALID [2022-04-28 02:41:32,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-28 02:41:32,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {600#true} #94#return; {600#true} is VALID [2022-04-28 02:41:32,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {600#true} call #t~ret15 := main(); {600#true} is VALID [2022-04-28 02:41:32,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {605#(= main_~j~0 0)} is VALID [2022-04-28 02:41:32,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {606#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} is VALID [2022-04-28 02:41:32,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {607#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:32,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:32,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {609#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 02:41:32,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {601#false} is VALID [2022-04-28 02:41:32,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#false} #t~short10 := ~i~0 >= 0; {601#false} is VALID [2022-04-28 02:41:32,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {601#false} is VALID [2022-04-28 02:41:32,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {601#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {601#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#false} ~k~0 := 1; {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {601#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {601#false} is VALID [2022-04-28 02:41:32,962 INFO L272 TraceCheckUtils]: 19: Hoare triple {601#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#false} ~cond := #in~cond; {601#false} is VALID [2022-04-28 02:41:32,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#false} assume 0 == ~cond; {601#false} is VALID [2022-04-28 02:41:32,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {601#false} assume !false; {601#false} is VALID [2022-04-28 02:41:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692580023] [2022-04-28 02:41:32,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692580023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911667958] [2022-04-28 02:41:32,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:32,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:32,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:32,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:32,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 02:41:33,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:33,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:33,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:41:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:36,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {600#true} call ULTIMATE.init(); {600#true} is VALID [2022-04-28 02:41:36,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#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(19, 2);call #Ultimate.allocInit(12, 3); {600#true} is VALID [2022-04-28 02:41:36,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-28 02:41:36,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {600#true} #94#return; {600#true} is VALID [2022-04-28 02:41:36,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {600#true} call #t~ret15 := main(); {600#true} is VALID [2022-04-28 02:41:36,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {605#(= main_~j~0 0)} is VALID [2022-04-28 02:41:36,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {605#(= main_~j~0 0)} is VALID [2022-04-28 02:41:36,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {635#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:41:36,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(= (+ (- 1) main_~j~0) 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} #t~short10 := ~i~0 >= 0; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:36,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {666#(and (<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296)) (= main_~k~0 1))} is VALID [2022-04-28 02:41:36,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {666#(and (<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296)) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {601#false} is VALID [2022-04-28 02:41:36,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {601#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {601#false} is VALID [2022-04-28 02:41:36,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#false} ~cond := #in~cond; {601#false} is VALID [2022-04-28 02:41:36,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#false} assume 0 == ~cond; {601#false} is VALID [2022-04-28 02:41:36,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {601#false} assume !false; {601#false} is VALID [2022-04-28 02:41:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:36,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:52,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {601#false} assume !false; {601#false} is VALID [2022-04-28 02:41:52,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#false} assume 0 == ~cond; {601#false} is VALID [2022-04-28 02:41:52,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#false} ~cond := #in~cond; {601#false} is VALID [2022-04-28 02:41:52,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {601#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {601#false} is VALID [2022-04-28 02:41:52,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {694#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {601#false} is VALID [2022-04-28 02:41:52,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {694#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:52,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} #t~short10 := ~i~0 >= 0; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {725#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (< (mod main_~j~0 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296)) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {608#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:52,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {729#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {725#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (< (mod main_~j~0 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296)) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56)))} is VALID [2022-04-28 02:41:52,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {729#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {729#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} is VALID [2022-04-28 02:41:52,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {729#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} is VALID [2022-04-28 02:41:52,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {600#true} call #t~ret15 := main(); {600#true} is VALID [2022-04-28 02:41:52,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {600#true} #94#return; {600#true} is VALID [2022-04-28 02:41:52,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-28 02:41:52,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#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(19, 2);call #Ultimate.allocInit(12, 3); {600#true} is VALID [2022-04-28 02:41:52,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {600#true} call ULTIMATE.init(); {600#true} is VALID [2022-04-28 02:41:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911667958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:52,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2022-04-28 02:41:52,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:52,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319462882] [2022-04-28 02:41:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319462882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:52,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519726987] [2022-04-28 02:41:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:41:52,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:52,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:52,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:52,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:41:52,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:41:52,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=2, NotChecked=0, Total=156 [2022-04-28 02:41:52,761 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:53,119 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-04-28 02:41:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:41:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:41:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-28 02:41:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-28 02:41:53,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-04-28 02:41:53,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:53,172 INFO L225 Difference]: With dead ends: 54 [2022-04-28 02:41:53,172 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 02:41:53,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=74, Invalid=230, Unknown=2, NotChecked=0, Total=306 [2022-04-28 02:41:53,174 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:53,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 51 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 02:41:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 02:41:53,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:53,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:53,188 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:53,188 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:53,189 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 02:41:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 02:41:53,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:53,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:53,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 02:41:53,190 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 02:41:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:53,191 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 02:41:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 02:41:53,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:53,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:53,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:53,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 02:41:53,192 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 23 [2022-04-28 02:41:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:53,193 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 02:41:53,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:53,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 02:41:53,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 02:41:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:53,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:53,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:53,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 02:41:53,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 02:41:53,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1068097608, now seen corresponding path program 3 times [2022-04-28 02:41:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:53,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986075274] [2022-04-28 02:41:53,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:53,445 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:53,446 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1068097608, now seen corresponding path program 4 times [2022-04-28 02:41:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:53,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821732829] [2022-04-28 02:41:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:53,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {1019#(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(19, 2);call #Ultimate.allocInit(12, 3); {1001#true} is VALID [2022-04-28 02:41:53,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-28 02:41:53,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1001#true} {1001#true} #94#return; {1001#true} is VALID [2022-04-28 02:41:53,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {1001#true} call ULTIMATE.init(); {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:53,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#(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(19, 2);call #Ultimate.allocInit(12, 3); {1001#true} is VALID [2022-04-28 02:41:53,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-28 02:41:53,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1001#true} {1001#true} #94#return; {1001#true} is VALID [2022-04-28 02:41:53,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1001#true} call #t~ret15 := main(); {1001#true} is VALID [2022-04-28 02:41:53,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:53,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {1006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:53,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1006#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:53,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:53,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:53,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:53,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:53,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1009#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:41:53,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {1009#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {1010#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (= (+ |main_~#v~0.offset| (* main_~i~0 4)) 0) (and (not |main_#t~short10|) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-28 02:41:53,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (= (+ |main_~#v~0.offset| (* main_~i~0 4)) 0) (and (not |main_#t~short10|) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1011#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-28 02:41:53,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1012#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:41:53,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1012#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1013#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:53,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {1013#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:53,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:53,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {1015#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:41:53,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {1015#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1016#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:53,958 INFO L272 TraceCheckUtils]: 21: Hoare triple {1016#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1017#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:41:53,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {1017#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1018#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:41:53,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1018#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1002#false} is VALID [2022-04-28 02:41:53,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-04-28 02:41:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:53,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821732829] [2022-04-28 02:41:53,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821732829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:53,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662972454] [2022-04-28 02:41:53,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:53,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:53,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 02:41:54,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:54,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:54,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:41:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:54,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:54,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:41:54,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-28 02:41:54,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:54,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-28 02:41:54,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {1001#true} call ULTIMATE.init(); {1001#true} is VALID [2022-04-28 02:41:54,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {1001#true} is VALID [2022-04-28 02:41:54,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-28 02:41:54,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1001#true} {1001#true} #94#return; {1001#true} is VALID [2022-04-28 02:41:54,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {1001#true} call #t~ret15 := main(); {1001#true} is VALID [2022-04-28 02:41:54,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:54,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1008#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:54,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {1008#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:54,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {1008#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:54,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:54,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1008#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:54,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:54,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1059#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:41:54,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {1059#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1063#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-28 02:41:54,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1067#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-28 02:41:54,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1071#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:41:54,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:54,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:54,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:54,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {1014#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {1015#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:41:54,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {1015#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1016#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:54,562 INFO L272 TraceCheckUtils]: 21: Hoare triple {1016#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:54,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {1090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:54,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1002#false} is VALID [2022-04-28 02:41:54,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-04-28 02:41:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:41:54,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:54,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-04-28 02:41:54,958 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 02:41:54,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 90 [2022-04-28 02:41:55,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2022-04-28 02:41:55,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1002#false} is VALID [2022-04-28 02:41:55,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {1090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:55,120 INFO L272 TraceCheckUtils]: 21: Hoare triple {1016#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:55,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {1113#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1016#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:55,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {1117#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {1113#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-28 02:41:55,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {1117#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1117#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:41:55,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {1117#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1117#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:41:55,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {1127#(forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1117#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:41:55,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#(or |main_#t~short10| (forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1127#(forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:41:55,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1131#(or |main_#t~short10| (forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-28 02:41:55,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {1139#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {1135#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:55,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {1143#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1139#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:55,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {1001#true} ~j~0 := 1; {1143#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:41:55,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {1001#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1001#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {1001#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {1001#true} call #t~ret15 := main(); {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1001#true} {1001#true} #94#return; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#true} assume true; {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {1001#true} is VALID [2022-04-28 02:41:55,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {1001#true} call ULTIMATE.init(); {1001#true} is VALID [2022-04-28 02:41:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:41:55,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662972454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:55,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:55,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-28 02:41:55,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:55,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986075274] [2022-04-28 02:41:55,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986075274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:55,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:55,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:41:55,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696962140] [2022-04-28 02:41:55,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:41:55,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:55,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:55,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:55,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:41:55,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:41:55,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-28 02:41:55,150 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:56,179 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 02:41:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:41:56,180 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:41:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2022-04-28 02:41:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2022-04-28 02:41:56,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2022-04-28 02:41:56,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:56,267 INFO L225 Difference]: With dead ends: 83 [2022-04-28 02:41:56,267 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 02:41:56,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 02:41:56,269 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 103 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:56,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:41:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 02:41:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-04-28 02:41:56,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:56,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:56,311 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:56,311 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:56,313 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 02:41:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 02:41:56,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:56,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:56,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 64 states. [2022-04-28 02:41:56,314 INFO L87 Difference]: Start difference. First operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 64 states. [2022-04-28 02:41:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:56,315 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 02:41:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 02:41:56,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:56,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:56,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:56,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 02:41:56,317 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 25 [2022-04-28 02:41:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:56,317 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 02:41:56,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 02:41:56,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 02:41:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:56,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:56,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:56,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 02:41:56,578 WARN L477 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-28 02:41:56,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash -367033030, now seen corresponding path program 1 times [2022-04-28 02:41:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:56,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2122222414] [2022-04-28 02:41:56,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:56,582 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:56,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash -367033030, now seen corresponding path program 2 times [2022-04-28 02:41:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:56,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951610643] [2022-04-28 02:41:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:56,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {1608#(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(19, 2);call #Ultimate.allocInit(12, 3); {1600#true} is VALID [2022-04-28 02:41:56,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {1600#true} assume true; {1600#true} is VALID [2022-04-28 02:41:56,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1600#true} {1600#true} #94#return; {1600#true} is VALID [2022-04-28 02:41:56,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {1600#true} call ULTIMATE.init(); {1608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:56,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {1608#(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(19, 2);call #Ultimate.allocInit(12, 3); {1600#true} is VALID [2022-04-28 02:41:56,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {1600#true} assume true; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1600#true} {1600#true} #94#return; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {1600#true} call #t~ret15 := main(); {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {1600#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {1600#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {1600#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1600#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1600#true} is VALID [2022-04-28 02:41:56,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {1600#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1600#true} is VALID [2022-04-28 02:41:56,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {1600#true} ~j~0 := 1; {1605#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:41:56,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(= (+ (- 1) main_~j~0) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1606#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 02:41:56,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {1606#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {1607#|main_#t~short10|} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {1607#|main_#t~short10|} assume !#t~short10; {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {1601#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {1601#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#false} ~k~0 := 1; {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L272 TraceCheckUtils]: 21: Hoare triple {1601#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#false} ~cond := #in~cond; {1601#false} is VALID [2022-04-28 02:41:56,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#false} assume 0 == ~cond; {1601#false} is VALID [2022-04-28 02:41:56,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2022-04-28 02:41:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:41:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951610643] [2022-04-28 02:41:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951610643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:56,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:56,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2122222414] [2022-04-28 02:41:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2122222414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:56,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947676430] [2022-04-28 02:41:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:56,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:41:56,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:56,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:41:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:56,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:41:56,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:41:56,667 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:56,903 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-28 02:41:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:41:56,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:41:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 02:41:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 02:41:56,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 02:41:56,960 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-28 02:41:56,961 INFO L225 Difference]: With dead ends: 92 [2022-04-28 02:41:56,961 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 02:41:56,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:41:56,962 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:56,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 37 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 02:41:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-04-28 02:41:57,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:57,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:57,008 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:57,009 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:57,010 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 02:41:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 02:41:57,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:57,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:57,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-28 02:41:57,010 INFO L87 Difference]: Start difference. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-28 02:41:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:57,012 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 02:41:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 02:41:57,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:57,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:57,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:57,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-04-28 02:41:57,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 25 [2022-04-28 02:41:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:57,014 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-04-28 02:41:57,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:57,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 59 transitions. [2022-04-28 02:41:57,076 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-28 02:41:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-04-28 02:41:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:41:57,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:57,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:57,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:41:57,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1586594931, now seen corresponding path program 1 times [2022-04-28 02:41:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:57,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675700752] [2022-04-28 02:41:57,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:57,080 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:57,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1586594931, now seen corresponding path program 2 times [2022-04-28 02:41:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:57,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922647224] [2022-04-28 02:41:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:57,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2036#(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(19, 2);call #Ultimate.allocInit(12, 3); {2015#true} is VALID [2022-04-28 02:41:57,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2015#true} assume true; {2015#true} is VALID [2022-04-28 02:41:57,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2015#true} {2015#true} #94#return; {2015#true} is VALID [2022-04-28 02:41:57,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2015#true} call ULTIMATE.init(); {2036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:57,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2036#(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(19, 2);call #Ultimate.allocInit(12, 3); {2015#true} is VALID [2022-04-28 02:41:57,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2015#true} assume true; {2015#true} is VALID [2022-04-28 02:41:57,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2015#true} {2015#true} #94#return; {2015#true} is VALID [2022-04-28 02:41:57,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {2015#true} call #t~ret15 := main(); {2015#true} is VALID [2022-04-28 02:41:57,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {2015#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2020#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:57,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2020#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:57,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2021#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:57,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {2021#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2021#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:57,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {2021#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2022#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:57,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {2022#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2022#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:57,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {2022#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {2021#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:57,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {2021#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2023#(and (= |main_~#v~0.offset| 0) (or (<= (+ main_~i~0 1) 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:57,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {2023#(and (= |main_~#v~0.offset| 0) (or (<= (+ main_~i~0 1) 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {2024#(or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:57,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2025#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:41:57,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {2025#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {2026#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:57,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {2026#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {2027#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:57,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {2027#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {2028#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:57,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {2028#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2029#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} is VALID [2022-04-28 02:41:57,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} assume !#t~short10; {2030#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:57,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {2030#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2030#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:57,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {2030#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2031#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:57,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {2031#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2031#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:57,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {2031#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2031#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:57,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {2031#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {2032#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:41:57,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {2032#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2033#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:41:57,610 INFO L272 TraceCheckUtils]: 26: Hoare triple {2033#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2034#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:41:57,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {2034#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2035#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:41:57,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {2035#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2016#false} is VALID [2022-04-28 02:41:57,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {2016#false} assume !false; {2016#false} is VALID [2022-04-28 02:41:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922647224] [2022-04-28 02:41:57,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922647224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531652107] [2022-04-28 02:41:57,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:57,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:57,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:57,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:57,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 02:41:57,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:57,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:57,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 02:41:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:57,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:57,984 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-28 02:41:57,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-04-28 02:41:58,683 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-04-28 02:41:58,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2022-04-28 02:41:59,707 INFO L356 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-04-28 02:41:59,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 16 [2022-04-28 02:41:59,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {2015#true} call ULTIMATE.init(); {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {2015#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(19, 2);call #Ultimate.allocInit(12, 3); {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {2015#true} assume true; {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2015#true} {2015#true} #94#return; {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {2015#true} call #t~ret15 := main(); {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {2015#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {2015#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2015#true} is VALID [2022-04-28 02:41:59,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {2015#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2015#true} is VALID [2022-04-28 02:41:59,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {2015#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2015#true} is VALID [2022-04-28 02:41:59,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {2015#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2015#true} is VALID [2022-04-28 02:41:59,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {2015#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2015#true} is VALID [2022-04-28 02:41:59,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {2015#true} ~j~0 := 1; {2073#(<= main_~j~0 1)} is VALID [2022-04-28 02:41:59,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {2073#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2077#(<= main_~i~0 0)} is VALID [2022-04-28 02:41:59,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2077#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {2081#(and (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 02:41:59,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {2081#(and (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2085#(and (<= main_~i~0 0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0))} is VALID [2022-04-28 02:41:59,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {2085#(and (<= main_~i~0 0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {2089#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:41:59,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {2089#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= 0 main_~i~0))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {2093#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0))} is VALID [2022-04-28 02:41:59,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {2093#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0))} ~i~0 := ~i~0 - 1; {2097#(exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-28 02:41:59,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {2097#(exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} #t~short10 := ~i~0 >= 0; {2101#(and (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 02:41:59,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#(and (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {2105#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} is VALID [2022-04-28 02:41:59,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {2105#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2105#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} is VALID [2022-04-28 02:41:59,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {2105#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2112#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-28 02:41:59,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {2112#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2112#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-28 02:41:59,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {2112#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2112#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-28 02:41:59,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} ~k~0 := 1; {2122#(and (exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (= main_~k~0 1))} is VALID [2022-04-28 02:41:59,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {2122#(and (exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2033#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:41:59,878 INFO L272 TraceCheckUtils]: 26: Hoare triple {2033#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:59,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:59,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2016#false} is VALID [2022-04-28 02:41:59,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {2016#false} assume !false; {2016#false} is VALID [2022-04-28 02:41:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:41:59,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:06,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2022-04-28 02:42:06,508 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-28 02:42:06,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 717 treesize of output 657 [2022-04-28 02:42:08,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {2016#false} assume !false; {2016#false} is VALID [2022-04-28 02:42:08,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2016#false} is VALID [2022-04-28 02:42:08,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:08,708 INFO L272 TraceCheckUtils]: 26: Hoare triple {2149#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:08,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {2153#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2149#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:08,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {2157#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {2153#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-28 02:42:08,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {2157#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2157#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:08,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {2157#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2157#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:08,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {2167#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2157#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:08,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2167#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:42:08,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {2174#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {2167#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:42:08,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {2178#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {2174#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 02:42:08,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {2182#(forall ((v_main_~i~0_14 Int)) (or (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 v_main_~i~0_14)))} ~i~0 := ~i~0 - 1; {2178#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} is VALID [2022-04-28 02:42:08,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {2186#(forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70))))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {2182#(forall ((v_main_~i~0_14 Int)) (or (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 v_main_~i~0_14)))} is VALID [2022-04-28 02:42:09,625 WARN L290 TraceCheckUtils]: 15: Hoare triple {2190#(or (not |main_#t~short10|) (forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {2186#(forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70))))} is UNKNOWN [2022-04-28 02:42:09,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {2194#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2190#(or (not |main_#t~short10|) (forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70)))))} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {2015#true} #t~short10 := ~i~0 >= 0; {2194#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {2015#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {2015#true} ~j~0 := 1; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {2015#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {2015#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {2015#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {2015#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {2015#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {2015#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {2015#true} call #t~ret15 := main(); {2015#true} is VALID [2022-04-28 02:42:09,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2015#true} {2015#true} #94#return; {2015#true} is VALID [2022-04-28 02:42:09,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {2015#true} assume true; {2015#true} is VALID [2022-04-28 02:42:09,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {2015#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(19, 2);call #Ultimate.allocInit(12, 3); {2015#true} is VALID [2022-04-28 02:42:09,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {2015#true} call ULTIMATE.init(); {2015#true} is VALID [2022-04-28 02:42:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:42:09,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531652107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:09,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:09,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 14] total 42 [2022-04-28 02:42:09,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:09,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675700752] [2022-04-28 02:42:09,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675700752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:09,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:09,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:42:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104006761] [2022-04-28 02:42:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:09,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:09,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:09,654 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-28 02:42:09,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:42:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:42:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1529, Unknown=5, NotChecked=0, Total=1722 [2022-04-28 02:42:09,655 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:12,257 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-28 02:42:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 02:42:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 148 transitions. [2022-04-28 02:42:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 148 transitions. [2022-04-28 02:42:12,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 148 transitions. [2022-04-28 02:42:12,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:12,400 INFO L225 Difference]: With dead ends: 140 [2022-04-28 02:42:12,400 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 02:42:12,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=610, Invalid=4077, Unknown=5, NotChecked=0, Total=4692 [2022-04-28 02:42:12,402 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 135 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:12,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 82 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 02:42:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 02:42:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 56. [2022-04-28 02:42:12,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:12,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:12,501 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:12,501 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:12,504 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-28 02:42:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-28 02:42:12,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:12,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:12,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 105 states. [2022-04-28 02:42:12,505 INFO L87 Difference]: Start difference. First operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 105 states. [2022-04-28 02:42:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:12,507 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-28 02:42:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-28 02:42:12,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:12,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:12,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:12,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2022-04-28 02:42:12,509 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 30 [2022-04-28 02:42:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:12,509 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2022-04-28 02:42:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 02:42:12,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 66 transitions. [2022-04-28 02:42:12,594 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-28 02:42:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-28 02:42:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 02:42:12,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:12,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:12,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:12,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:12,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 932991851, now seen corresponding path program 5 times [2022-04-28 02:42:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:12,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036993720] [2022-04-28 02:42:12,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:12,800 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:12,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 932991851, now seen corresponding path program 6 times [2022-04-28 02:42:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684504480] [2022-04-28 02:42:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:12,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {2906#(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(19, 2);call #Ultimate.allocInit(12, 3); {2895#true} is VALID [2022-04-28 02:42:12,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {2895#true} assume true; {2895#true} is VALID [2022-04-28 02:42:12,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2895#true} {2895#true} #94#return; {2895#true} is VALID [2022-04-28 02:42:12,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {2895#true} call ULTIMATE.init(); {2906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:12,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2906#(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(19, 2);call #Ultimate.allocInit(12, 3); {2895#true} is VALID [2022-04-28 02:42:12,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2895#true} assume true; {2895#true} is VALID [2022-04-28 02:42:12,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2895#true} {2895#true} #94#return; {2895#true} is VALID [2022-04-28 02:42:12,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {2895#true} call #t~ret15 := main(); {2895#true} is VALID [2022-04-28 02:42:12,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {2895#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2900#(= main_~j~0 0)} is VALID [2022-04-28 02:42:12,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2900#(= main_~j~0 0)} is VALID [2022-04-28 02:42:12,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:12,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:12,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2902#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:42:12,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2903#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:12,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {2903#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:12,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:12,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:12,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:12,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:12,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:12,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2905#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2896#false} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#false} #t~short10 := ~i~0 >= 0; {2896#false} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2896#false} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2896#false} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2896#false} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {2896#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2896#false} is VALID [2022-04-28 02:42:12,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {2896#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {2896#false} ~k~0 := 1; {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {2896#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L272 TraceCheckUtils]: 27: Hoare triple {2896#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {2896#false} ~cond := #in~cond; {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {2896#false} assume 0 == ~cond; {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {2896#false} assume !false; {2896#false} is VALID [2022-04-28 02:42:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684504480] [2022-04-28 02:42:12,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684504480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406204820] [2022-04-28 02:42:12,918 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:42:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:12,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:12,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:42:12,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 02:42:12,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:12,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:42:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:13,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:13,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {2895#true} call ULTIMATE.init(); {2895#true} is VALID [2022-04-28 02:42:13,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {2895#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(19, 2);call #Ultimate.allocInit(12, 3); {2895#true} is VALID [2022-04-28 02:42:13,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {2895#true} assume true; {2895#true} is VALID [2022-04-28 02:42:13,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2895#true} {2895#true} #94#return; {2895#true} is VALID [2022-04-28 02:42:13,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {2895#true} call #t~ret15 := main(); {2895#true} is VALID [2022-04-28 02:42:13,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {2895#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2900#(= main_~j~0 0)} is VALID [2022-04-28 02:42:13,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2900#(= main_~j~0 0)} is VALID [2022-04-28 02:42:13,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:13,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:13,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {2901#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2937#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:13,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {2937#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2903#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:13,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {2903#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {2904#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2962#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {2962#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#false} #t~short10 := ~i~0 >= 0; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {2896#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {2896#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {2896#false} ~k~0 := 1; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {2896#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L272 TraceCheckUtils]: 27: Hoare triple {2896#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {2896#false} ~cond := #in~cond; {2896#false} is VALID [2022-04-28 02:42:13,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {2896#false} assume 0 == ~cond; {2896#false} is VALID [2022-04-28 02:42:13,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {2896#false} assume !false; {2896#false} is VALID [2022-04-28 02:42:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:13,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:13,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {2896#false} assume !false; {2896#false} is VALID [2022-04-28 02:42:13,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {2896#false} assume 0 == ~cond; {2896#false} is VALID [2022-04-28 02:42:13,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {2896#false} ~cond := #in~cond; {2896#false} is VALID [2022-04-28 02:42:13,860 INFO L272 TraceCheckUtils]: 27: Hoare triple {2896#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2896#false} is VALID [2022-04-28 02:42:13,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {2896#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2896#false} is VALID [2022-04-28 02:42:13,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {2896#false} ~k~0 := 1; {2896#false} is VALID [2022-04-28 02:42:13,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {2896#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2896#false} is VALID [2022-04-28 02:42:13,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {2896#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2896#false} is VALID [2022-04-28 02:42:13,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2896#false} is VALID [2022-04-28 02:42:13,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2896#false} is VALID [2022-04-28 02:42:13,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2896#false} is VALID [2022-04-28 02:42:13,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#false} #t~short10 := ~i~0 >= 0; {2896#false} is VALID [2022-04-28 02:42:13,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2896#false} is VALID [2022-04-28 02:42:13,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2905#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:13,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:42:13,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:42:13,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:42:13,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:42:13,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:42:13,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {2903#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3041#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:42:13,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {3063#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2903#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:13,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3063#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-28 02:42:13,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {3067#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3067#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:42:13,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {3074#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3067#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:42:13,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {3074#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3074#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:42:13,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {2895#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3074#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:42:13,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {2895#true} call #t~ret15 := main(); {2895#true} is VALID [2022-04-28 02:42:13,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2895#true} {2895#true} #94#return; {2895#true} is VALID [2022-04-28 02:42:13,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {2895#true} assume true; {2895#true} is VALID [2022-04-28 02:42:13,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {2895#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(19, 2);call #Ultimate.allocInit(12, 3); {2895#true} is VALID [2022-04-28 02:42:13,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {2895#true} call ULTIMATE.init(); {2895#true} is VALID [2022-04-28 02:42:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:13,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406204820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:13,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:13,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 02:42:13,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:13,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036993720] [2022-04-28 02:42:13,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036993720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:13,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:13,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:42:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342312423] [2022-04-28 02:42:13,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 02:42:13,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:13,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:13,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:13,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:42:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:42:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:42:13,894 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:14,722 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-04-28 02:42:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:42:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 02:42:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-28 02:42:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-28 02:42:14,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-28 02:42:14,811 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-28 02:42:14,813 INFO L225 Difference]: With dead ends: 147 [2022-04-28 02:42:14,813 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 02:42:14,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:42:14,813 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:14,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 47 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:42:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 02:42:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-04-28 02:42:15,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:15,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:15,002 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:15,002 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:15,004 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-04-28 02:42:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-04-28 02:42:15,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:15,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:15,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 107 states. [2022-04-28 02:42:15,005 INFO L87 Difference]: Start difference. First operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 107 states. [2022-04-28 02:42:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:15,017 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-04-28 02:42:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-04-28 02:42:15,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:15,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:15,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:15,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-04-28 02:42:15,019 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 31 [2022-04-28 02:42:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:15,020 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-04-28 02:42:15,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:15,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 83 transitions. [2022-04-28 02:42:15,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-28 02:42:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:42:15,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:15,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:15,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:15,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:15,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 912710034, now seen corresponding path program 1 times [2022-04-28 02:42:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:15,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [522522851] [2022-04-28 02:42:15,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:15,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:15,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash 912710034, now seen corresponding path program 2 times [2022-04-28 02:42:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:15,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163380662] [2022-04-28 02:42:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:15,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {3775#(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(19, 2);call #Ultimate.allocInit(12, 3); {3760#true} is VALID [2022-04-28 02:42:15,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:15,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3760#true} {3760#true} #94#return; {3760#true} is VALID [2022-04-28 02:42:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 02:42:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:15,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-04-28 02:42:15,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-04-28 02:42:15,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:15,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3760#true} {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #92#return; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:15,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {3760#true} call ULTIMATE.init(); {3775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:15,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {3775#(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(19, 2);call #Ultimate.allocInit(12, 3); {3760#true} is VALID [2022-04-28 02:42:15,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:15,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3760#true} {3760#true} #94#return; {3760#true} is VALID [2022-04-28 02:42:15,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {3760#true} call #t~ret15 := main(); {3760#true} is VALID [2022-04-28 02:42:15,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {3760#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3765#(= main_~j~0 0)} is VALID [2022-04-28 02:42:15,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {3765#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3765#(= main_~j~0 0)} is VALID [2022-04-28 02:42:15,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {3765#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:15,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:15,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3767#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:42:15,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {3767#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:15,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:15,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:15,550 INFO L272 TraceCheckUtils]: 21: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3760#true} is VALID [2022-04-28 02:42:15,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-04-28 02:42:15,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-04-28 02:42:15,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:15,551 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3760#true} {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #92#return; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:15,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:15,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3774#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:15,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {3774#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3761#false} is VALID [2022-04-28 02:42:15,553 INFO L272 TraceCheckUtils]: 29: Hoare triple {3761#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3761#false} is VALID [2022-04-28 02:42:15,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {3761#false} ~cond := #in~cond; {3761#false} is VALID [2022-04-28 02:42:15,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {3761#false} assume 0 == ~cond; {3761#false} is VALID [2022-04-28 02:42:15,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {3761#false} assume !false; {3761#false} is VALID [2022-04-28 02:42:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:42:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:15,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163380662] [2022-04-28 02:42:15,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163380662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:15,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305127758] [2022-04-28 02:42:15,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:15,554 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:15,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:42:15,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:15,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:15,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:42:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:15,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:16,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {3760#true} call ULTIMATE.init(); {3760#true} is VALID [2022-04-28 02:42:16,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#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(19, 2);call #Ultimate.allocInit(12, 3); {3760#true} is VALID [2022-04-28 02:42:16,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:16,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3760#true} {3760#true} #94#return; {3760#true} is VALID [2022-04-28 02:42:16,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {3760#true} call #t~ret15 := main(); {3760#true} is VALID [2022-04-28 02:42:16,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {3760#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3765#(= main_~j~0 0)} is VALID [2022-04-28 02:42:16,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {3765#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3765#(= main_~j~0 0)} is VALID [2022-04-28 02:42:16,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {3765#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:16,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:16,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {3766#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3806#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:16,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {3806#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:16,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:16,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:16,185 INFO L272 TraceCheckUtils]: 21: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3760#true} is VALID [2022-04-28 02:42:16,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-04-28 02:42:16,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-04-28 02:42:16,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:16,185 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3760#true} {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #92#return; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:16,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:16,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3861#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:42:16,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {3861#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3761#false} is VALID [2022-04-28 02:42:16,187 INFO L272 TraceCheckUtils]: 29: Hoare triple {3761#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3761#false} is VALID [2022-04-28 02:42:16,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {3761#false} ~cond := #in~cond; {3761#false} is VALID [2022-04-28 02:42:16,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {3761#false} assume 0 == ~cond; {3761#false} is VALID [2022-04-28 02:42:16,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {3761#false} assume !false; {3761#false} is VALID [2022-04-28 02:42:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:42:16,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:17,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {3761#false} assume !false; {3761#false} is VALID [2022-04-28 02:42:17,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {3761#false} assume 0 == ~cond; {3761#false} is VALID [2022-04-28 02:42:17,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {3761#false} ~cond := #in~cond; {3761#false} is VALID [2022-04-28 02:42:17,776 INFO L272 TraceCheckUtils]: 29: Hoare triple {3761#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3761#false} is VALID [2022-04-28 02:42:17,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {3889#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3761#false} is VALID [2022-04-28 02:42:17,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3889#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:42:17,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} havoc #t~mem13;havoc #t~mem14; {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:42:17,778 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3760#true} {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #92#return; {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:42:17,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:17,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-04-28 02:42:17,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-04-28 02:42:17,786 INFO L272 TraceCheckUtils]: 21: Hoare triple {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3760#true} is VALID [2022-04-28 02:42:17,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:42:17,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3893#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:42:17,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {3945#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3768#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:42:17,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {3949#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3945#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-28 02:42:17,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {3949#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3949#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:42:17,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {3956#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3949#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:42:17,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {3956#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3956#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:42:17,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {3760#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3956#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:42:17,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {3760#true} call #t~ret15 := main(); {3760#true} is VALID [2022-04-28 02:42:17,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3760#true} {3760#true} #94#return; {3760#true} is VALID [2022-04-28 02:42:17,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-04-28 02:42:17,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#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(19, 2);call #Ultimate.allocInit(12, 3); {3760#true} is VALID [2022-04-28 02:42:17,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {3760#true} call ULTIMATE.init(); {3760#true} is VALID [2022-04-28 02:42:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:42:17,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305127758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:17,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:17,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:42:17,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:17,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [522522851] [2022-04-28 02:42:17,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [522522851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:17,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:17,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:42:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845802947] [2022-04-28 02:42:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-28 02:42:17,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:17,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:42:17,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:17,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:42:17,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:17,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:42:17,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:42:17,827 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:42:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:18,564 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2022-04-28 02:42:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:42:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-28 02:42:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:42:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 02:42:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:42:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 02:42:18,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-28 02:42:18,648 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-28 02:42:18,649 INFO L225 Difference]: With dead ends: 116 [2022-04-28 02:42:18,649 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 02:42:18,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:42:18,650 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 126 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:18,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 46 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:42:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 02:42:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-04-28 02:42:18,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:18,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:18,817 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:18,823 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:18,833 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-28 02:42:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-28 02:42:18,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:18,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:18,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-28 02:42:18,835 INFO L87 Difference]: Start difference. First operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-28 02:42:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:18,844 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-28 02:42:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-28 02:42:18,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:18,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:18,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:18,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-28 02:42:18,846 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 33 [2022-04-28 02:42:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:18,846 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-28 02:42:18,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:42:18,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 76 transitions. [2022-04-28 02:42:18,948 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-28 02:42:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-28 02:42:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:42:18,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:18,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:18,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 02:42:19,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:19,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1010087575, now seen corresponding path program 7 times [2022-04-28 02:42:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:19,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978857398] [2022-04-28 02:42:19,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:19,167 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:19,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1010087575, now seen corresponding path program 8 times [2022-04-28 02:42:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:19,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907894548] [2022-04-28 02:42:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:19,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#(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(19, 2);call #Ultimate.allocInit(12, 3); {4532#true} is VALID [2022-04-28 02:42:19,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {4532#true} assume true; {4532#true} is VALID [2022-04-28 02:42:19,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4532#true} {4532#true} #94#return; {4532#true} is VALID [2022-04-28 02:42:19,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {4532#true} call ULTIMATE.init(); {4553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:19,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#(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(19, 2);call #Ultimate.allocInit(12, 3); {4532#true} is VALID [2022-04-28 02:42:19,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {4532#true} assume true; {4532#true} is VALID [2022-04-28 02:42:19,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4532#true} {4532#true} #94#return; {4532#true} is VALID [2022-04-28 02:42:19,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {4532#true} call #t~ret15 := main(); {4532#true} is VALID [2022-04-28 02:42:19,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {4532#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4537#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:19,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {4537#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4537#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:19,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {4537#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:19,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:19,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4539#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-28 02:42:19,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {4539#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:19,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {4540#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:19,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {4540#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:19,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {4540#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:19,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4541#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:42:19,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {4541#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {4542#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-28 02:42:19,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {4542#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4543#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-28 02:42:19,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {4543#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4544#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:42:19,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {4544#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4545#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:19,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4546#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-28 02:42:19,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {4546#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:19,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:19,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:19,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:19,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:19,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:19,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:19,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {4549#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:42:19,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {4549#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4550#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:19,685 INFO L272 TraceCheckUtils]: 29: Hoare triple {4550#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:19,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {4551#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4552#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:19,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {4552#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4533#false} is VALID [2022-04-28 02:42:19,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {4533#false} assume !false; {4533#false} is VALID [2022-04-28 02:42:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:19,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907894548] [2022-04-28 02:42:19,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907894548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:19,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568401843] [2022-04-28 02:42:19,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:19,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:19,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:19,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:19,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:42:19,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:19,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:19,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 02:42:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:19,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:19,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-28 02:42:20,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:20,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:20,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:20,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:20,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2022-04-28 02:42:20,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:20,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-28 02:42:20,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {4532#true} call ULTIMATE.init(); {4532#true} is VALID [2022-04-28 02:42:20,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {4532#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(19, 2);call #Ultimate.allocInit(12, 3); {4532#true} is VALID [2022-04-28 02:42:20,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {4532#true} assume true; {4532#true} is VALID [2022-04-28 02:42:20,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4532#true} {4532#true} #94#return; {4532#true} is VALID [2022-04-28 02:42:20,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {4532#true} call #t~ret15 := main(); {4532#true} is VALID [2022-04-28 02:42:20,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {4532#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {4540#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {4540#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {4540#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {4540#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {4540#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {4540#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {4540#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4540#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:20,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {4540#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:20,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {4538#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4541#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:42:20,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {4541#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {4602#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 02:42:20,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {4602#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4543#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-28 02:42:20,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {4543#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4544#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:42:20,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {4544#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4545#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:20,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {4545#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4546#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-28 02:42:20,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {4546#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:20,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:20,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:20,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:20,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {4547#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:20,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:20,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:20,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {4548#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {4549#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:42:20,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {4549#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4550#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:20,143 INFO L272 TraceCheckUtils]: 29: Hoare triple {4550#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:20,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {4645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:20,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {4649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4533#false} is VALID [2022-04-28 02:42:20,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {4533#false} assume !false; {4533#false} is VALID [2022-04-28 02:42:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:20,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:24,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-04-28 02:42:24,900 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 02:42:24,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 761 treesize of output 727 [2022-04-28 02:42:32,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {4533#false} assume !false; {4533#false} is VALID [2022-04-28 02:42:32,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {4649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4533#false} is VALID [2022-04-28 02:42:32,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {4645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:32,459 INFO L272 TraceCheckUtils]: 29: Hoare triple {4550#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:32,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {4668#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4550#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:32,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {4672#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {4668#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-28 02:42:32,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {4672#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4672#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:32,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {4672#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4672#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:32,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4672#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:32,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:32,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:32,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:32,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4682#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:32,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {4699#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4695#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:32,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {4703#(forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4699#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:32,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {4707#(or (forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4703#(forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:42:32,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {4711#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4707#(or (forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 02:42:32,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {4715#(or (not (<= 0 main_~i~0)) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4711#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:32,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {4719#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4715#(or (not (<= 0 main_~i~0)) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:32,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {4532#true} ~j~0 := 1; {4719#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {4532#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {4532#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {4532#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {4532#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {4532#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {4532#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {4532#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {4532#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {4532#true} call #t~ret15 := main(); {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4532#true} {4532#true} #94#return; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {4532#true} assume true; {4532#true} is VALID [2022-04-28 02:42:32,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {4532#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(19, 2);call #Ultimate.allocInit(12, 3); {4532#true} is VALID [2022-04-28 02:42:32,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {4532#true} call ULTIMATE.init(); {4532#true} is VALID [2022-04-28 02:42:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:32,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568401843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:32,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:32,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 32 [2022-04-28 02:42:32,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:32,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978857398] [2022-04-28 02:42:32,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978857398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:32,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:32,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:42:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954306454] [2022-04-28 02:42:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 02:42:32,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:32,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:32,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:42:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:42:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:42:32,497 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:34,106 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2022-04-28 02:42:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 02:42:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 02:42:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 133 transitions. [2022-04-28 02:42:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 133 transitions. [2022-04-28 02:42:34,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 133 transitions. [2022-04-28 02:42:34,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:34,230 INFO L225 Difference]: With dead ends: 174 [2022-04-28 02:42:34,230 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 02:42:34,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 02:42:34,237 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 168 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:34,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 60 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 02:42:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 02:42:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2022-04-28 02:42:34,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:34,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:34,399 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:34,400 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:34,401 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-28 02:42:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-28 02:42:34,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:34,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:34,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 134 states. [2022-04-28 02:42:34,402 INFO L87 Difference]: Start difference. First operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 134 states. [2022-04-28 02:42:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:34,404 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-28 02:42:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-28 02:42:34,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:34,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:34,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:34,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-04-28 02:42:34,405 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 33 [2022-04-28 02:42:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:34,406 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-04-28 02:42:34,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:34,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 87 transitions. [2022-04-28 02:42:34,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-04-28 02:42:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:42:34,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:34,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:34,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:34,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 925785056, now seen corresponding path program 1 times [2022-04-28 02:42:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25519182] [2022-04-28 02:42:34,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:34,786 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:34,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 925785056, now seen corresponding path program 2 times [2022-04-28 02:42:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:34,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687509180] [2022-04-28 02:42:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:35,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#(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(19, 2);call #Ultimate.allocInit(12, 3); {5564#true} is VALID [2022-04-28 02:42:35,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 02:42:35,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5564#true} {5564#true} #94#return; {5564#true} is VALID [2022-04-28 02:42:35,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5583#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:35,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {5583#(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(19, 2);call #Ultimate.allocInit(12, 3); {5564#true} is VALID [2022-04-28 02:42:35,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 02:42:35,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #94#return; {5564#true} is VALID [2022-04-28 02:42:35,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret15 := main(); {5564#true} is VALID [2022-04-28 02:42:35,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {5564#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5569#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:35,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {5569#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5569#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:35,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {5569#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {5571#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {5571#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {5571#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {5571#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5572#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-28 02:42:35,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:35,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:35,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:35,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:35,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:35,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {5573#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} ~i~0 := ~i~0 - 1; {5574#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2022-04-28 02:42:35,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {5574#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short10 := ~i~0 >= 0; {5575#(or (and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0)) (not |main_#t~short10|))} is VALID [2022-04-28 02:42:35,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {5575#(or (and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0)) (not |main_#t~short10|))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5576#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-28 02:42:35,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {5576#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5577#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:42:35,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {5577#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:35,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:35,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:35,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {5579#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:42:35,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {5579#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5580#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:35,084 INFO L272 TraceCheckUtils]: 34: Hoare triple {5580#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5581#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:35,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {5581#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5582#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:35,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5565#false} is VALID [2022-04-28 02:42:35,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2022-04-28 02:42:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:42:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:35,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687509180] [2022-04-28 02:42:35,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687509180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:35,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627576349] [2022-04-28 02:42:35,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:35,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:35,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:42:35,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:35,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:35,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:42:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:35,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:35,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:35,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-28 02:42:35,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:35,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-28 02:42:35,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5564#true} is VALID [2022-04-28 02:42:35,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {5564#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(19, 2);call #Ultimate.allocInit(12, 3); {5564#true} is VALID [2022-04-28 02:42:35,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 02:42:35,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #94#return; {5564#true} is VALID [2022-04-28 02:42:35,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret15 := main(); {5564#true} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {5564#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {5571#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {5571#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {5571#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {5571#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {5571#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {5571#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5571#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:35,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {5571#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:35,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {5570#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5644#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:35,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {5644#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:35,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~short10 := ~i~0 >= 0; {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:35,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:35,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:35,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {5648#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1) (<= 1 main_~i~0))} ~i~0 := ~i~0 - 1; {5664#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {5668#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-28 02:42:35,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {5668#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5576#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-28 02:42:35,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {5576#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5577#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:42:35,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {5577#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:35,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:35,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:35,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {5578#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {5579#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:42:35,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {5579#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5580#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:35,614 INFO L272 TraceCheckUtils]: 34: Hoare triple {5580#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:35,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {5693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:35,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {5697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5565#false} is VALID [2022-04-28 02:42:35,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2022-04-28 02:42:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:35,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:35,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-04-28 02:42:35,894 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 02:42:35,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 90 [2022-04-28 02:42:36,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2022-04-28 02:42:36,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {5697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5565#false} is VALID [2022-04-28 02:42:36,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {5693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:36,177 INFO L272 TraceCheckUtils]: 34: Hoare triple {5580#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:36,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5580#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:36,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {5720#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {5716#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-28 02:42:36,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {5720#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5720#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:36,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {5720#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5720#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:36,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {5730#(forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5720#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-28 02:42:36,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {5734#(or (forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5730#(forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:42:36,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {5738#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5734#(or (forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 02:42:36,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {5742#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5738#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:36,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} ~i~0 := ~i~0 - 1; {5742#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:36,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 02:42:36,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 02:42:36,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 02:42:36,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} #t~short10 := ~i~0 >= 0; {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 02:42:36,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {5762#(or (= (+ (* main_~j~0 4) (- 8)) 0) (not (<= 2 main_~j~0)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5746#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 02:42:36,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5762#(or (= (+ (* main_~j~0 4) (- 8)) 0) (not (<= 2 main_~j~0)))} is VALID [2022-04-28 02:42:36,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:42:36,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:42:36,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:42:36,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~short10 := ~i~0 >= 0; {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {5564#true} ~j~0 := 1; {5766#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {5564#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5564#true} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {5564#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5564#true} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {5564#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5564#true} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {5564#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5564#true} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {5564#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5564#true} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {5564#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5564#true} is VALID [2022-04-28 02:42:36,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {5564#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {5564#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret15 := main(); {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #94#return; {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {5564#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(19, 2);call #Ultimate.allocInit(12, 3); {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5564#true} is VALID [2022-04-28 02:42:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:36,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627576349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:36,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:36,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 32 [2022-04-28 02:42:36,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:36,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25519182] [2022-04-28 02:42:36,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25519182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:36,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:36,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:42:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853477760] [2022-04-28 02:42:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:36,189 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:36,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:36,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:36,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:36,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:42:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:42:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:42:36,216 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:38,799 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2022-04-28 02:42:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 02:42:38,800 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 176 transitions. [2022-04-28 02:42:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 176 transitions. [2022-04-28 02:42:38,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 176 transitions. [2022-04-28 02:42:38,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:38,925 INFO L225 Difference]: With dead ends: 197 [2022-04-28 02:42:38,925 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 02:42:38,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=766, Invalid=3524, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 02:42:38,927 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 188 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:38,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 70 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:42:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 02:42:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 80. [2022-04-28 02:42:39,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:39,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 80 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:39,114 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 80 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:39,114 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 80 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:39,116 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2022-04-28 02:42:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2022-04-28 02:42:39,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:39,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:39,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 157 states. [2022-04-28 02:42:39,117 INFO L87 Difference]: Start difference. First operand has 80 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 157 states. [2022-04-28 02:42:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:39,119 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2022-04-28 02:42:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2022-04-28 02:42:39,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:39,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:39,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:39,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2022-04-28 02:42:39,121 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 38 [2022-04-28 02:42:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:39,121 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2022-04-28 02:42:39,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 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-28 02:42:39,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 96 transitions. [2022-04-28 02:42:39,267 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-28 02:42:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2022-04-28 02:42:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:42:39,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:39,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:39,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:39,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 02:42:39,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1626849634, now seen corresponding path program 3 times [2022-04-28 02:42:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:39,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [38116104] [2022-04-28 02:42:39,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:39,489 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:39,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1626849634, now seen corresponding path program 4 times [2022-04-28 02:42:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:39,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028917669] [2022-04-28 02:42:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:39,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {6772#(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(19, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-28 02:42:39,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-28 02:42:39,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6762#true} {6762#true} #94#return; {6762#true} is VALID [2022-04-28 02:42:39,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {6762#true} call ULTIMATE.init(); {6772#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:39,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {6772#(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(19, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6762#true} {6762#true} #94#return; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {6762#true} call #t~ret15 := main(); {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {6762#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {6762#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6762#true} is VALID [2022-04-28 02:42:39,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {6762#true} ~j~0 := 1; {6767#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:42:39,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {6767#(= (+ (- 1) main_~j~0) 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6767#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:42:39,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {6767#(= (+ (- 1) main_~j~0) 0)} #t~short10 := ~i~0 >= 0; {6767#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:42:39,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {6767#(= (+ (- 1) main_~j~0) 0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6767#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:42:39,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {6767#(= (+ (- 1) main_~j~0) 0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6767#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:42:39,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {6767#(= (+ (- 1) main_~j~0) 0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6767#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:42:39,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {6767#(= (+ (- 1) main_~j~0) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6768#(<= 2 main_~j~0)} is VALID [2022-04-28 02:42:39,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {6768#(<= 2 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {6769#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {6769#(<= 1 main_~i~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {6769#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {6769#(<= 1 main_~i~0)} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {6769#(<= 1 main_~i~0)} ~i~0 := ~i~0 - 1; {6770#(<= 0 main_~i~0)} is VALID [2022-04-28 02:42:39,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {6771#|main_#t~short10|} is VALID [2022-04-28 02:42:39,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {6771#|main_#t~short10|} assume !#t~short10; {6763#false} is VALID [2022-04-28 02:42:39,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {6763#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6763#false} is VALID [2022-04-28 02:42:39,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {6763#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {6763#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {6763#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {6763#false} ~k~0 := 1; {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {6763#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L272 TraceCheckUtils]: 34: Hoare triple {6763#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {6763#false} ~cond := #in~cond; {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {6763#false} assume 0 == ~cond; {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {6763#false} assume !false; {6763#false} is VALID [2022-04-28 02:42:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:39,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:39,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028917669] [2022-04-28 02:42:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028917669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:39,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233722471] [2022-04-28 02:42:39,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:42:39,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:39,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:39,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:39,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 02:42:39,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:42:39,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:39,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:42:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:39,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:39,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {6762#true} call ULTIMATE.init(); {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {6762#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(19, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6762#true} {6762#true} #94#return; {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {6762#true} call #t~ret15 := main(); {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {6762#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {6762#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6762#true} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {6762#true} ~j~0 := 1; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {6815#(<= 1 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {6815#(<= 1 main_~j~0)} #t~short10 := ~i~0 >= 0; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {6815#(<= 1 main_~j~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {6815#(<= 1 main_~j~0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {6815#(<= 1 main_~j~0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= 1 main_~j~0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6768#(<= 2 main_~j~0)} is VALID [2022-04-28 02:42:39,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {6768#(<= 2 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {6769#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {6769#(<= 1 main_~i~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {6769#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {6769#(<= 1 main_~i~0)} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {6769#(<= 1 main_~i~0)} ~i~0 := ~i~0 - 1; {6770#(<= 0 main_~i~0)} is VALID [2022-04-28 02:42:39,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {6771#|main_#t~short10|} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {6771#|main_#t~short10|} assume !#t~short10; {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {6763#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {6763#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {6763#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {6763#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {6763#false} ~k~0 := 1; {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {6763#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L272 TraceCheckUtils]: 34: Hoare triple {6763#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6763#false} is VALID [2022-04-28 02:42:39,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {6763#false} ~cond := #in~cond; {6763#false} is VALID [2022-04-28 02:42:39,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {6763#false} assume 0 == ~cond; {6763#false} is VALID [2022-04-28 02:42:39,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {6763#false} assume !false; {6763#false} is VALID [2022-04-28 02:42:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:39,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:39,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {6763#false} assume !false; {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {6763#false} assume 0 == ~cond; {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {6763#false} ~cond := #in~cond; {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L272 TraceCheckUtils]: 34: Hoare triple {6763#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {6763#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {6763#false} ~k~0 := 1; {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {6763#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {6763#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {6763#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6763#false} is VALID [2022-04-28 02:42:39,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {6763#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6763#false} is VALID [2022-04-28 02:42:39,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {6771#|main_#t~short10|} assume !#t~short10; {6763#false} is VALID [2022-04-28 02:42:39,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {6771#|main_#t~short10|} is VALID [2022-04-28 02:42:39,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {6769#(<= 1 main_~i~0)} ~i~0 := ~i~0 - 1; {6770#(<= 0 main_~i~0)} is VALID [2022-04-28 02:42:39,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {6769#(<= 1 main_~i~0)} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {6769#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {6769#(<= 1 main_~i~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {6769#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {6768#(<= 2 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6769#(<= 1 main_~i~0)} is VALID [2022-04-28 02:42:39,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= 1 main_~j~0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6768#(<= 2 main_~j~0)} is VALID [2022-04-28 02:42:39,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {6815#(<= 1 main_~j~0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {6815#(<= 1 main_~j~0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {6815#(<= 1 main_~j~0)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {6815#(<= 1 main_~j~0)} #t~short10 := ~i~0 >= 0; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {6815#(<= 1 main_~j~0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {6762#true} ~j~0 := 1; {6815#(<= 1 main_~j~0)} is VALID [2022-04-28 02:42:39,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {6762#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6762#true} is VALID [2022-04-28 02:42:39,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {6762#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {6762#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {6762#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {6762#true} call #t~ret15 := main(); {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6762#true} {6762#true} #94#return; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {6762#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(19, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {6762#true} call ULTIMATE.init(); {6762#true} is VALID [2022-04-28 02:42:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:39,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233722471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:39,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:39,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-28 02:42:39,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:39,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [38116104] [2022-04-28 02:42:39,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [38116104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:39,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:39,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144603583] [2022-04-28 02:42:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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 38 [2022-04-28 02:42:39,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:39,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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-28 02:42:39,917 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-28 02:42:39,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:42:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:39,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:42:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:42:39,918 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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-28 02:42:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:40,914 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2022-04-28 02:42:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:42:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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 38 [2022-04-28 02:42:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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-28 02:42:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-28 02:42:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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-28 02:42:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-28 02:42:40,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2022-04-28 02:42:41,028 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-28 02:42:41,029 INFO L225 Difference]: With dead ends: 165 [2022-04-28 02:42:41,029 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 02:42:41,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:42:41,030 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 126 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:41,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 48 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:42:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 02:42:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2022-04-28 02:42:41,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:41,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 88 states, 80 states have (on average 1.2) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:41,294 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 88 states, 80 states have (on average 1.2) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:41,294 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 88 states, 80 states have (on average 1.2) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,296 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 02:42:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 02:42:41,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:41,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:41,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 80 states have (on average 1.2) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 119 states. [2022-04-28 02:42:41,297 INFO L87 Difference]: Start difference. First operand has 88 states, 80 states have (on average 1.2) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 119 states. [2022-04-28 02:42:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:41,298 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 02:42:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 02:42:41,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:41,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:41,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:41,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.2) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2022-04-28 02:42:41,300 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 38 [2022-04-28 02:42:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:41,300 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2022-04-28 02:42:41,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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-28 02:42:41,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 103 transitions. [2022-04-28 02:42:41,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-28 02:42:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:42:41,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:41,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:41,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:41,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:41,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash 909842600, now seen corresponding path program 5 times [2022-04-28 02:42:41,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:41,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587022908] [2022-04-28 02:42:41,735 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:41,735 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:41,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 909842600, now seen corresponding path program 6 times [2022-04-28 02:42:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212790444] [2022-04-28 02:42:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {7786#(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(19, 2);call #Ultimate.allocInit(12, 3); {7761#true} is VALID [2022-04-28 02:42:42,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7761#true} assume true; {7761#true} is VALID [2022-04-28 02:42:42,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7761#true} {7761#true} #94#return; {7761#true} is VALID [2022-04-28 02:42:42,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {7761#true} call ULTIMATE.init(); {7786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:42,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7786#(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(19, 2);call #Ultimate.allocInit(12, 3); {7761#true} is VALID [2022-04-28 02:42:42,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {7761#true} assume true; {7761#true} is VALID [2022-04-28 02:42:42,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7761#true} {7761#true} #94#return; {7761#true} is VALID [2022-04-28 02:42:42,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {7761#true} call #t~ret15 := main(); {7761#true} is VALID [2022-04-28 02:42:42,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {7761#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {7766#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:42,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {7766#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7766#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:42,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {7766#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:42,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:42,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7768#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:42,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {7768#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7768#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:42,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {7768#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:42,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {7769#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:42,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {7769#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:42,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7770#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= (+ main_~i~0 1) 0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:42,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {7770#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= (+ main_~i~0 1) 0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {7771#(or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:42,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {7771#(or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7772#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:42,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {7772#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {7773#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:42,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {7773#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {7774#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:42,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {7774#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {7775#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)))} is VALID [2022-04-28 02:42:42,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {7775#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)))} #t~short10 := ~i~0 >= 0; {7776#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 02:42:42,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {7776#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|) (= (+ (- 1) main_~j~0) 0))} assume !#t~short10; {7777#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {7777#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7777#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {7777#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7778#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {7778#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7779#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {7779#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:42,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} #t~short10 := ~i~0 >= 0; {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:42,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:42,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:42,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {7780#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:42,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {7782#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:42:42,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {7782#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {7783#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:42,382 INFO L272 TraceCheckUtils]: 34: Hoare triple {7783#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:42,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {7784#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7785#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:42,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {7785#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7762#false} is VALID [2022-04-28 02:42:42,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {7762#false} assume !false; {7762#false} is VALID [2022-04-28 02:42:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:42,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212790444] [2022-04-28 02:42:42,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212790444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:42,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584705486] [2022-04-28 02:42:42,383 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:42:42,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:42,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:42,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:42,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 02:42:42,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:42:42,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:42,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 02:42:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:42,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:42,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-04-28 02:42:42,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:42,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:42,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-04-28 02:42:43,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:43,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:43,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:43,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:43,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-04-28 02:42:43,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:43,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-04-28 02:42:43,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {7761#true} call ULTIMATE.init(); {7761#true} is VALID [2022-04-28 02:42:43,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {7761#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(19, 2);call #Ultimate.allocInit(12, 3); {7761#true} is VALID [2022-04-28 02:42:43,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {7761#true} assume true; {7761#true} is VALID [2022-04-28 02:42:43,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7761#true} {7761#true} #94#return; {7761#true} is VALID [2022-04-28 02:42:43,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {7761#true} call #t~ret15 := main(); {7761#true} is VALID [2022-04-28 02:42:43,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {7761#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {7769#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {7769#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {7769#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {7769#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {7769#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {7769#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {7769#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7769#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:43,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {7769#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:43,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {7767#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7832#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:43,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {7832#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {7832#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:43,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {7832#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7772#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:43,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {7772#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {7773#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:43,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {7773#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {7845#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:43,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {7845#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10; {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {7849#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (- 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7778#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {7778#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7865#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {7865#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {7869#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {7869#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {7873#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) |main_#t~short10|)} is VALID [2022-04-28 02:42:43,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {7873#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {7869#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {7869#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7869#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {7869#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:43,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {7781#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {7782#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-28 02:42:43,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {7782#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {7895#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:42:43,164 INFO L272 TraceCheckUtils]: 34: Hoare triple {7895#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:43,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {7899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:43,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {7903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7762#false} is VALID [2022-04-28 02:42:43,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {7762#false} assume !false; {7762#false} is VALID [2022-04-28 02:42:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:43,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:52,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2022-04-28 02:42:52,630 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 02:42:52,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22803 treesize of output 22043