/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:16,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:16,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:16,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:16,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:16,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:16,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:16,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:16,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:16,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:16,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:16,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:16,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:16,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:16,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:16,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:16,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:16,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:16,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:16,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:17,001 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:17,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:17,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:17,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:17,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:17,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:17,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:17,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:17,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:17,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:17,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:17,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:17,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:17,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:17,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:17,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:17,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:17,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:17,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:17,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:17,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:17,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:17,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:00:17,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:17,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:17,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:17,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:17,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:17,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:17,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:17,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:17,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:17,041 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:17,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:17,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:17,042 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:17,043 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:17,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:17,043 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:17,043 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 09:00:17,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:17,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:17,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:17,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:17,398 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:17,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-28 09:00:17,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3389693/a16af338cc104de691a716fbd209b724/FLAGcfcb2a027 [2022-04-28 09:00:17,978 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:17,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-28 09:00:17,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3389693/a16af338cc104de691a716fbd209b724/FLAGcfcb2a027 [2022-04-28 09:00:18,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3389693/a16af338cc104de691a716fbd209b724 [2022-04-28 09:00:18,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:18,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:18,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:18,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:18,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:18,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5c77bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18, skipping insertion in model container [2022-04-28 09:00:18,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:18,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:18,661 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-2.c[328,341] [2022-04-28 09:00:18,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:18,732 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:18,758 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-2.c[328,341] [2022-04-28 09:00:18,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:18,797 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:18,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18 WrapperNode [2022-04-28 09:00:18,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:18,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:18,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:18,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:18,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:18,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:18,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:18,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:18,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (1/1) ... [2022-04-28 09:00:18,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:18,908 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 09:00:18,914 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 09:00:18,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:18,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:18,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:18,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:00:18,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:19,052 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:19,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:19,334 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:19,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:19,338 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 09:00:19,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:19 BoogieIcfgContainer [2022-04-28 09:00:19,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:19,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:19,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:19,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:19,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:18" (1/3) ... [2022-04-28 09:00:19,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec99a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:19, skipping insertion in model container [2022-04-28 09:00:19,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:18" (2/3) ... [2022-04-28 09:00:19,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec99a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:19, skipping insertion in model container [2022-04-28 09:00:19,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:19" (3/3) ... [2022-04-28 09:00:19,360 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2022-04-28 09:00:19,392 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:19,392 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:19,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:19,473 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@664a5cf6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22297aa8 [2022-04-28 09:00:19,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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 09:00:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:00:19,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:19,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:19,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 1 times [2022-04-28 09:00:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243534363] [2022-04-28 09:00:19,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 2 times [2022-04-28 09:00:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:19,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606956470] [2022-04-28 09:00:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:19,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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); {34#true} is VALID [2022-04-28 09:00:19,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 09:00:19,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-28 09:00:19,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:19,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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); {34#true} is VALID [2022-04-28 09:00:19,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 09:00:19,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-28 09:00:19,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret15 := main(); {34#true} is VALID [2022-04-28 09:00:19,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {34#true} is VALID [2022-04-28 09:00:19,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {34#true} is VALID [2022-04-28 09:00:19,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~j~0 := 1; {34#true} is VALID [2022-04-28 09:00:19,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 09:00:19,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~k~0 := 1; {35#false} is VALID [2022-04-28 09:00:19,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#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); {35#false} is VALID [2022-04-28 09:00:19,887 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {35#false} is VALID [2022-04-28 09:00:19,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 09:00:19,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 09:00:19,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 09:00:19,888 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 09:00:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:19,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606956470] [2022-04-28 09:00:19,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606956470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:19,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:19,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:19,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:19,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243534363] [2022-04-28 09:00:19,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243534363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:19,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:19,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:19,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245669693] [2022-04-28 09:00:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:19,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:19,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:19,939 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 09:00:19,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:00:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:00:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:00:19,983 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,168 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 09:00:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:00:20,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-28 09:00:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-28 09:00:20,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-28 09:00:20,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:20,299 INFO L225 Difference]: With dead ends: 54 [2022-04-28 09:00:20,299 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:00:20,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:00:20,320 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:20,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:00:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 09:00:20,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:20,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,365 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,365 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,368 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:00:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:00:20,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:20,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:20,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-28 09:00:20,370 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-28 09:00:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,372 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:00:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:00:20,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:20,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:20,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:20,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 09:00:20,390 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2022-04-28 09:00:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:20,391 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 09:00:20,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 09:00:20,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 09:00:20,435 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 09:00:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:00:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:00:20,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:20,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:20,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:00:20,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 1 times [2022-04-28 09:00:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:20,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315408096] [2022-04-28 09:00:20,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 2 times [2022-04-28 09:00:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:20,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743407349] [2022-04-28 09:00:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(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); {254#true} is VALID [2022-04-28 09:00:20,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-28 09:00:20,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-28 09:00:20,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:20,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(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); {254#true} is VALID [2022-04-28 09:00:20,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-28 09:00:20,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-28 09:00:20,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret15 := main(); {254#true} is VALID [2022-04-28 09:00:20,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {259#(= main_~j~0 0)} is VALID [2022-04-28 09:00:20,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:20,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:20,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:20,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:20,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} 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); {255#false} is VALID [2022-04-28 09:00:20,693 INFO L272 TraceCheckUtils]: 11: Hoare triple {255#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {255#false} is VALID [2022-04-28 09:00:20,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-28 09:00:20,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-28 09:00:20,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-28 09:00:20,694 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 09:00:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743407349] [2022-04-28 09:00:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743407349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:20,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:20,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:20,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315408096] [2022-04-28 09:00:20,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315408096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:20,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:20,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556971559] [2022-04-28 09:00:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:20,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:20,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:20,728 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 09:00:20,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:00:20,729 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:20,992 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 09:00:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:00:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 09:00:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 09:00:21,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 09:00:21,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:21,085 INFO L225 Difference]: With dead ends: 49 [2022-04-28 09:00:21,085 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 09:00:21,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:00:21,087 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:21,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 09:00:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 09:00:21,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:21,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 09:00:21,096 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 09:00:21,097 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 09:00:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:21,101 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 09:00:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 09:00:21,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:21,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:21,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-04-28 09:00:21,102 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-04-28 09:00:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:21,124 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 09:00:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 09:00:21,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:21,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:21,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:21,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 09:00:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 09:00:21,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-28 09:00:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:21,126 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 09:00:21,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:00:21,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 09:00:21,167 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 09:00:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 09:00:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:00:21,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:21,169 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 09:00:21,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:00:21,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:21,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 1 times [2022-04-28 09:00:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:21,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110379065] [2022-04-28 09:00:21,183 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:21,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 2 times [2022-04-28 09:00:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:21,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75702361] [2022-04-28 09:00:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:21,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(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); {481#true} is VALID [2022-04-28 09:00:21,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-28 09:00:21,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-28 09:00:21,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:21,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(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); {481#true} is VALID [2022-04-28 09:00:21,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-28 09:00:21,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-28 09:00:21,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-28 09:00:21,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {486#(= main_~j~0 0)} is VALID [2022-04-28 09:00:21,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= 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; {486#(= main_~j~0 0)} is VALID [2022-04-28 09:00:21,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {487#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:21,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 09:00:21,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 09:00:21,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 09:00:21,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {489#(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 09:00:21,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(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); {482#false} is VALID [2022-04-28 09:00:21,455 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-28 09:00:21,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-28 09:00:21,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-28 09:00:21,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-28 09:00:21,458 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 09:00:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75702361] [2022-04-28 09:00:21,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75702361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713002992] [2022-04-28 09:00:21,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:21,460 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 09:00:21,492 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 09:00:21,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:00:21,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:21,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:00:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:21,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:22,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-28 09:00:22,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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); {481#true} is VALID [2022-04-28 09:00:22,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-28 09:00:22,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-28 09:00:22,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-28 09:00:22,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {481#true} is VALID [2022-04-28 09:00:22,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#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; {481#true} is VALID [2022-04-28 09:00:22,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {481#true} is VALID [2022-04-28 09:00:22,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {481#true} is VALID [2022-04-28 09:00:22,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~j~0 := 1; {487#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:22,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 09:00:22,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {489#(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 09:00:22,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(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); {482#false} is VALID [2022-04-28 09:00:22,301 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-28 09:00:22,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-28 09:00:22,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-28 09:00:22,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-28 09:00:22,302 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 09:00:22,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:00:22,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713002992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:22,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:00:22,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-04-28 09:00:22,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:22,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110379065] [2022-04-28 09:00:22,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110379065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:22,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:22,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917093687] [2022-04-28 09:00:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:22,304 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 09:00:22,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:22,304 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 09:00:22,328 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 09:00:22,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:22,329 INFO L87 Difference]: Start difference. First operand 27 states and 31 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 09:00:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,435 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-28 09:00:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:22,435 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 09:00:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:22,436 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 09:00:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 09:00:22,437 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 09:00:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 09:00:22,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-28 09:00:22,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,480 INFO L225 Difference]: With dead ends: 45 [2022-04-28 09:00:22,480 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 09:00:22,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:00:22,482 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:22,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 09:00:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-28 09:00:22,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:22,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,500 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,500 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,502 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 09:00:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 09:00:22,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:22,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:22,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 09:00:22,504 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 09:00:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,510 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 09:00:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 09:00:22,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:22,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:22,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:22,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 09:00:22,512 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-04-28 09:00:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:22,512 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 09:00:22,512 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 09:00:22,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 09:00:22,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 09:00:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:00:22,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:22,545 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 09:00:22,566 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 09:00:22,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:22,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:22,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 1 times [2022-04-28 09:00:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:22,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945658383] [2022-04-28 09:00:22,768 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:22,768 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 2 times [2022-04-28 09:00:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:22,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559727716] [2022-04-28 09:00:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {766#(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); {757#true} is VALID [2022-04-28 09:00:22,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-28 09:00:22,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #87#return; {757#true} is VALID [2022-04-28 09:00:22,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:22,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {766#(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); {757#true} is VALID [2022-04-28 09:00:22,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-28 09:00:22,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #87#return; {757#true} is VALID [2022-04-28 09:00:22,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret15 := main(); {757#true} is VALID [2022-04-28 09:00:22,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {762#(= main_~j~0 0)} is VALID [2022-04-28 09:00:22,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {762#(= 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; {762#(= main_~j~0 0)} is VALID [2022-04-28 09:00:22,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {762#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {763#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:22,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {763#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:22,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {765#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 09:00:22,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {765#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~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; {758#false} is VALID [2022-04-28 09:00:22,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#false} #t~short10 := ~i~0 >= 0; {758#false} is VALID [2022-04-28 09:00:22,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#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; {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {758#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {758#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {758#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {758#false} ~k~0 := 1; {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {758#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); {758#false} is VALID [2022-04-28 09:00:22,871 INFO L272 TraceCheckUtils]: 19: Hoare triple {758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {758#false} ~cond := #in~cond; {758#false} is VALID [2022-04-28 09:00:22,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {758#false} assume 0 == ~cond; {758#false} is VALID [2022-04-28 09:00:22,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-28 09:00:22,872 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 09:00:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559727716] [2022-04-28 09:00:22,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559727716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254733748] [2022-04-28 09:00:22,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:22,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:22,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:22,873 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 09:00:22,874 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 09:00:22,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:22,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:22,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:00:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:23,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {757#true} is VALID [2022-04-28 09:00:23,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#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); {757#true} is VALID [2022-04-28 09:00:23,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-28 09:00:23,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #87#return; {757#true} is VALID [2022-04-28 09:00:23,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret15 := main(); {757#true} is VALID [2022-04-28 09:00:23,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {762#(= main_~j~0 0)} is VALID [2022-04-28 09:00:23,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {762#(= 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; {762#(= main_~j~0 0)} is VALID [2022-04-28 09:00:23,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {762#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {791#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:00:23,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {791#(= (+ (- 1) main_~j~0) 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#(<= main_~SIZE~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; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(<= main_~SIZE~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; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {822#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 09:00:23,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (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); {758#false} is VALID [2022-04-28 09:00:23,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {758#false} is VALID [2022-04-28 09:00:23,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {758#false} ~cond := #in~cond; {758#false} is VALID [2022-04-28 09:00:23,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {758#false} assume 0 == ~cond; {758#false} is VALID [2022-04-28 09:00:23,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-28 09:00:23,267 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 09:00:23,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:23,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-28 09:00:23,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {758#false} assume 0 == ~cond; {758#false} is VALID [2022-04-28 09:00:23,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {758#false} ~cond := #in~cond; {758#false} is VALID [2022-04-28 09:00:23,637 INFO L272 TraceCheckUtils]: 19: Hoare triple {758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {758#false} is VALID [2022-04-28 09:00:23,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {850#(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); {758#false} is VALID [2022-04-28 09:00:23,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {850#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 09:00:23,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(<= main_~SIZE~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; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#(<= main_~SIZE~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; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {764#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:23,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {881#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} is VALID [2022-04-28 09:00:23,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 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; {885#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-28 09:00:23,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {885#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-28 09:00:23,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret15 := main(); {757#true} is VALID [2022-04-28 09:00:23,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #87#return; {757#true} is VALID [2022-04-28 09:00:23,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-28 09:00:23,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#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); {757#true} is VALID [2022-04-28 09:00:23,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {757#true} is VALID [2022-04-28 09:00:23,645 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 09:00:23,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254733748] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:23,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:23,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 09:00:23,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:23,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945658383] [2022-04-28 09:00:23,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945658383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:23,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:23,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:00:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304305731] [2022-04-28 09:00:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:23,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:23,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,664 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 09:00:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:00:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:00:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:00:23,665 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,898 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-28 09:00:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:00:23,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 09:00:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 09:00:23,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 09:00:23,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,954 INFO L225 Difference]: With dead ends: 55 [2022-04-28 09:00:23,954 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 09:00:23,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:00:23,955 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:23,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 09:00:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-28 09:00:23,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:23,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 09:00:23,974 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 09:00:23,974 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 09:00:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,975 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 09:00:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 09:00:23,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:23,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:23,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 36 states. [2022-04-28 09:00:23,976 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 36 states. [2022-04-28 09:00:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,977 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 09:00:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 09:00:23,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:23,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:23,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:23,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 09:00:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-28 09:00:23,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-04-28 09:00:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:23,978 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-28 09:00:23,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 09:00:23,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-28 09:00:24,007 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 09:00:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 09:00:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:00:24,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:24,008 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 09:00:24,026 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 09:00:24,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:00:24,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 3 times [2022-04-28 09:00:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:24,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57678001] [2022-04-28 09:00:24,233 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:24,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 4 times [2022-04-28 09:00:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:24,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119597316] [2022-04-28 09:00:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:24,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {1177#(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); {1159#true} is VALID [2022-04-28 09:00:24,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {1159#true} assume true; {1159#true} is VALID [2022-04-28 09:00:24,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1159#true} {1159#true} #87#return; {1159#true} is VALID [2022-04-28 09:00:24,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1159#true} call ULTIMATE.init(); {1177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:24,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#(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); {1159#true} is VALID [2022-04-28 09:00:24,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2022-04-28 09:00:24,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1159#true} #87#return; {1159#true} is VALID [2022-04-28 09:00:24,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {1159#true} call #t~ret15 := main(); {1159#true} is VALID [2022-04-28 09:00:24,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {1159#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {1164#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:24,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {1164#(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; {1164#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:24,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {1164#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1165#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:24,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#(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; {1165#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:24,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#(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; {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:24,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {1166#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:24,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1166#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1165#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:24,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(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; {1167#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:00:24,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {1167#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {1168#(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 09:00:24,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#(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; {1169#(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 09:00:24,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {1169#(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; {1170#(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 09:00:24,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {1170#(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); {1171#(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 09:00:24,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {1171#(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; {1172#(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 09:00:24,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#(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); {1172#(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 09:00:24,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#(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; {1173#(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 09:00:24,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#(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); {1174#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:24,632 INFO L272 TraceCheckUtils]: 21: Hoare triple {1174#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1175#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:24,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {1175#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1176#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:24,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {1176#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1160#false} is VALID [2022-04-28 09:00:24,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#false} assume !false; {1160#false} is VALID [2022-04-28 09:00:24,633 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 09:00:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:24,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119597316] [2022-04-28 09:00:24,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119597316] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:24,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271878170] [2022-04-28 09:00:24,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:24,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:24,634 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 09:00:24,657 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 09:00:24,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:24,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:24,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:00:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:24,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:25,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:25,036 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 09:00:25,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:25,137 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 09:00:25,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {1159#true} call ULTIMATE.init(); {1159#true} is VALID [2022-04-28 09:00:25,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {1159#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); {1159#true} is VALID [2022-04-28 09:00:25,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2022-04-28 09:00:25,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1159#true} #87#return; {1159#true} is VALID [2022-04-28 09:00:25,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {1159#true} call #t~ret15 := main(); {1159#true} is VALID [2022-04-28 09:00:25,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {1159#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:25,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(= |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; {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:25,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:25,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#(= |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; {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:25,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:25,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {1166#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1166#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:25,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {1166#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1165#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:25,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(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; {1217#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-28 09:00:25,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1221#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-28 09:00:25,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#(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; {1225#(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 09:00:25,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#(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; {1229#(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 09:00:25,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(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); {1172#(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 09:00:25,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {1172#(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; {1172#(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 09:00:25,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#(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); {1172#(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 09:00:25,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#(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; {1173#(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 09:00:25,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#(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); {1174#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:25,208 INFO L272 TraceCheckUtils]: 21: Hoare triple {1174#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:25,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:25,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {1252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1160#false} is VALID [2022-04-28 09:00:25,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#false} assume !false; {1160#false} is VALID [2022-04-28 09:00:25,209 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 09:00:25,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:25,648 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 09:00:25,674 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 09:00:25,674 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 09:00:25,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#false} assume !false; {1160#false} is VALID [2022-04-28 09:00:25,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {1252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1160#false} is VALID [2022-04-28 09:00:25,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:25,819 INFO L272 TraceCheckUtils]: 21: Hoare triple {1174#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:25,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {1271#(<= (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); {1174#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:25,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1275#(<= (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; {1271#(<= (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 09:00:25,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1275#(<= (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); {1275#(<= (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 09:00:25,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(<= (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; {1275#(<= (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 09:00:25,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {1285#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1275#(<= (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 09:00:25,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {1289#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1285#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} is VALID [2022-04-28 09:00:25,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {1293#(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; {1289#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} is VALID [2022-04-28 09:00:25,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1297#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {1293#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1301#(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; {1297#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {1159#true} ~j~0 := 1; {1301#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {1159#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1159#true} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {1159#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1159#true} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {1159#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; {1159#true} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {1159#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1159#true} is VALID [2022-04-28 09:00:25,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {1159#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; {1159#true} is VALID [2022-04-28 09:00:25,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {1159#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {1159#true} is VALID [2022-04-28 09:00:25,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {1159#true} call #t~ret15 := main(); {1159#true} is VALID [2022-04-28 09:00:25,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1159#true} #87#return; {1159#true} is VALID [2022-04-28 09:00:25,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2022-04-28 09:00:25,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {1159#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); {1159#true} is VALID [2022-04-28 09:00:25,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {1159#true} call ULTIMATE.init(); {1159#true} is VALID [2022-04-28 09:00:25,824 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 09:00:25,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271878170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:25,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:25,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-28 09:00:25,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:25,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57678001] [2022-04-28 09:00:25,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57678001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:25,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:25,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:00:25,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506846032] [2022-04-28 09:00:25,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:25,825 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 09:00:25,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:25,826 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 09:00:25,840 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 09:00:25,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:00:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:00:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:00:25,841 INFO L87 Difference]: Start difference. First operand 30 states and 34 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 09:00:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:26,882 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 09:00:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:00:26,882 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 09:00:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:26,883 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 09:00:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-28 09:00:26,884 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 09:00:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-28 09:00:26,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 79 transitions. [2022-04-28 09:00:26,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:26,957 INFO L225 Difference]: With dead ends: 65 [2022-04-28 09:00:26,957 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 09:00:26,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 09:00:26,958 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 98 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:26,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 37 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:00:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 09:00:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-04-28 09:00:26,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:27,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 09:00:27,000 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 09:00:27,000 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 09:00:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:27,002 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 09:00:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 09:00:27,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:27,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:27,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 63 states. [2022-04-28 09:00:27,003 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 63 states. [2022-04-28 09:00:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:27,004 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 09:00:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 09:00:27,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:27,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:27,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:27,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 09:00:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 09:00:27,006 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 25 [2022-04-28 09:00:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:27,006 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 09:00:27,006 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 09:00:27,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 09:00:27,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 09:00:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:00:27,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:27,054 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 09:00:27,091 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 09:00:27,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:27,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 1 times [2022-04-28 09:00:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:27,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001730050] [2022-04-28 09:00:27,291 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:27,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 2 times [2022-04-28 09:00:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899232596] [2022-04-28 09:00:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:27,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {1726#(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); {1718#true} is VALID [2022-04-28 09:00:27,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-28 09:00:27,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1718#true} {1718#true} #87#return; {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:27,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1726#(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); {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1718#true} assume true; {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1718#true} {1718#true} #87#return; {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {1718#true} call #t~ret15 := main(); {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1718#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {1718#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; {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1718#true} is VALID [2022-04-28 09:00:27,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {1718#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; {1718#true} is VALID [2022-04-28 09:00:27,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {1718#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1718#true} is VALID [2022-04-28 09:00:27,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {1718#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1718#true} is VALID [2022-04-28 09:00:27,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#true} ~j~0 := 1; {1723#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:00:27,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {1723#(= (+ (- 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; {1724#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 09:00:27,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {1724#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {1725#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} is VALID [2022-04-28 09:00:27,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {1725#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} assume !#t~short10; {1719#false} is VALID [2022-04-28 09:00:27,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {1719#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1719#false} is VALID [2022-04-28 09:00:27,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {1719#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1719#false} is VALID [2022-04-28 09:00:27,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {1719#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1719#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1719#false} ~k~0 := 1; {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {1719#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); {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L272 TraceCheckUtils]: 21: Hoare triple {1719#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {1719#false} ~cond := #in~cond; {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {1719#false} assume 0 == ~cond; {1719#false} is VALID [2022-04-28 09:00:27,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2022-04-28 09:00:27,345 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 09:00:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:27,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899232596] [2022-04-28 09:00:27,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899232596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:27,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:27,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:27,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:27,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001730050] [2022-04-28 09:00:27,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001730050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:27,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:27,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694315247] [2022-04-28 09:00:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:27,346 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 09:00:27,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:27,347 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 09:00:27,360 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 09:00:27,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:00:27,361 INFO L87 Difference]: Start difference. First operand 44 states and 52 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 09:00:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:27,589 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 09:00:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:00:27,589 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 09:00:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:27,590 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 09:00:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 09:00:27,591 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 09:00:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 09:00:27,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-28 09:00:27,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:27,635 INFO L225 Difference]: With dead ends: 82 [2022-04-28 09:00:27,635 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 09:00:27,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:00:27,638 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:27,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 40 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 09:00:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-28 09:00:27,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:27,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 09:00:27,686 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 09:00:27,686 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 09:00:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:27,689 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-28 09:00:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-28 09:00:27,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:27,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:27,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 51 states. [2022-04-28 09:00:27,689 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 51 states. [2022-04-28 09:00:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:27,691 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-28 09:00:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-28 09:00:27,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:27,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:27,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:27,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 09:00:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-28 09:00:27,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-28 09:00:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:27,693 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-28 09:00:27,693 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 09:00:27,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-28 09:00:27,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 09:00:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 09:00:27,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:27,746 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] [2022-04-28 09:00:27,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 09:00:27,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 1 times [2022-04-28 09:00:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:27,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251006203] [2022-04-28 09:00:27,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:27,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 2 times [2022-04-28 09:00:27,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:27,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282886923] [2022-04-28 09:00:27,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:27,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:28,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {2113#(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); {2093#true} is VALID [2022-04-28 09:00:28,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 09:00:28,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #87#return; {2093#true} is VALID [2022-04-28 09:00:28,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:28,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2113#(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); {2093#true} is VALID [2022-04-28 09:00:28,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 09:00:28,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #87#return; {2093#true} is VALID [2022-04-28 09:00:28,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret15 := main(); {2093#true} is VALID [2022-04-28 09:00:28,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {2093#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {2098#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:28,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {2098#(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; {2098#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:28,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {2098#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2099#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:28,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {2099#(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; {2099#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:28,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {2099#(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; {2100#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:28,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {2100#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2100#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:28,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {2100#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {2099#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:28,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {2099#(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; {2101#(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 09:00:28,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {2101#(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; {2102#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not |main_#t~short10|))} is VALID [2022-04-28 09:00:28,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (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; {2103#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 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 09:00:28,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {2103#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 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;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;~i~0 := ~i~0 - 1; {2104#(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))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:00:28,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#(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))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2105#(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) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} is VALID [2022-04-28 09:00:28,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#(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) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} assume !#t~short10; {2106#(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_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:00:28,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {2106#(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_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2106#(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_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:00:28,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {2106#(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_~#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); {2107#(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 09:00:28,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {2107#(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; {2108#(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 09:00:28,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {2108#(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); {2108#(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 09:00:28,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {2108#(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; {2109#(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 09:00:28,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {2109#(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); {2110#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:00:28,172 INFO L272 TraceCheckUtils]: 24: Hoare triple {2110#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:28,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2112#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:28,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {2112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 09:00:28,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 09:00:28,175 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 09:00:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:28,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282886923] [2022-04-28 09:00:28,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282886923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:28,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243701984] [2022-04-28 09:00:28,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:28,176 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 09:00:28,177 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 09:00:28,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:28,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:28,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 09:00:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:28,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:28,538 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-28 09:00:28,538 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 09:00:29,140 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-04-28 09:00:29,140 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 09:00:30,173 INFO L356 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-04-28 09:00:30,175 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 09:00:30,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2022-04-28 09:00:30,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {2093#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); {2093#true} is VALID [2022-04-28 09:00:30,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #87#return; {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret15 := main(); {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {2093#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {2093#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; {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#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; {2093#true} is VALID [2022-04-28 09:00:30,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {2093#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2093#true} is VALID [2022-04-28 09:00:30,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {2093#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2093#true} is VALID [2022-04-28 09:00:30,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {2093#true} ~j~0 := 1; {2150#(<= main_~j~0 1)} is VALID [2022-04-28 09:00:30,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {2150#(<= 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; {2154#(<= main_~i~0 0)} is VALID [2022-04-28 09:00:30,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {2154#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {2158#(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 09:00:30,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {2158#(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; {2162#(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 09:00:30,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {2162#(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;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;~i~0 := ~i~0 - 1; {2166#(exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= v_main_~i~0_11 0) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))))))} is VALID [2022-04-28 09:00:30,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {2166#(exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= v_main_~i~0_11 0) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))))))} #t~short10 := ~i~0 >= 0; {2170#(and (exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= v_main_~i~0_11 0) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 09:00:30,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {2170#(and (exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= v_main_~i~0_11 0) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {2174#(and (< main_~i~0 0) (exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4)))))))} is VALID [2022-04-28 09:00:30,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {2174#(and (< main_~i~0 0) (exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4)))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2174#(and (< main_~i~0 0) (exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4)))))))} is VALID [2022-04-28 09:00:30,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {2174#(and (< main_~i~0 0) (exists ((v_main_~i~0_11 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4) 4))) (<= v_main_~i~0_11 (+ main_~i~0 1)) (<= 0 v_main_~i~0_11) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_11 4)))))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2181#(exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11)))} is VALID [2022-04-28 09:00:30,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {2181#(exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2181#(exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11)))} is VALID [2022-04-28 09:00:30,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {2181#(exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2181#(exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11)))} is VALID [2022-04-28 09:00:30,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {2181#(exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11)))} ~k~0 := 1; {2191#(and (exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11))) (= main_~k~0 1))} is VALID [2022-04-28 09:00:30,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {2191#(and (exists ((main_~i~0 Int) (v_main_~i~0_11 Int)) (and (< main_~i~0 0) (<= v_main_~i~0_11 (+ main_~i~0 1)) (< (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_11 4) 4))) (<= 0 v_main_~i~0_11))) (= 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); {2110#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:00:30,377 INFO L272 TraceCheckUtils]: 24: Hoare triple {2110#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:30,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:30,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {2202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 09:00:30,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 09:00:30,381 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 09:00:30,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:31,485 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 09:00:31,579 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-28 09:00:31,580 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 771 treesize of output 711 [2022-04-28 09:00:32,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 09:00:32,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {2202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 09:00:32,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:32,920 INFO L272 TraceCheckUtils]: 24: Hoare triple {2218#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:32,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {2222#(<= (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); {2218#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:32,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {2226#(<= (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; {2222#(<= (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 09:00:32,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(<= (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); {2226#(<= (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 09:00:32,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {2226#(<= (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; {2226#(<= (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 09:00:32,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2226#(<= (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 09:00:32,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2236#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:32,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {2243#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {2236#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:32,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {2247#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} #t~short10 := ~i~0 >= 0; {2243#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:00:32,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {2251#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |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_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {2247#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-28 09:00:32,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2255#(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; {2251#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |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_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} is VALID [2022-04-28 09:00:32,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#true} #t~short10 := ~i~0 >= 0; {2255#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:32,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#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; {2093#true} is VALID [2022-04-28 09:00:32,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {2093#true} ~j~0 := 1; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {2093#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {2093#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#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; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {2093#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; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {2093#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret15 := main(); {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #87#return; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {2093#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); {2093#true} is VALID [2022-04-28 09:00:32,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2022-04-28 09:00:32,931 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 09:00:32,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243701984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:32,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 37 [2022-04-28 09:00:32,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:32,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251006203] [2022-04-28 09:00:32,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251006203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:32,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:00:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225574411] [2022-04-28 09:00:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 09:00:32,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:32,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:32,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:32,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:00:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:00:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1177, Unknown=1, NotChecked=0, Total=1332 [2022-04-28 09:00:32,957 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:34,516 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2022-04-28 09:00:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:00:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 09:00:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 101 transitions. [2022-04-28 09:00:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 101 transitions. [2022-04-28 09:00:34,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 101 transitions. [2022-04-28 09:00:34,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:34,605 INFO L225 Difference]: With dead ends: 111 [2022-04-28 09:00:34,605 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 09:00:34,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=348, Invalid=2513, Unknown=1, NotChecked=0, Total=2862 [2022-04-28 09:00:34,606 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:34,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 71 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:00:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 09:00:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2022-04-28 09:00:34,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:34,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 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 09:00:34,685 INFO L74 IsIncluded]: Start isIncluded. First operand 80 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 09:00:34,685 INFO L87 Difference]: Start difference. First operand 80 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 09:00:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:34,687 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-28 09:00:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-28 09:00:34,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:34,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:34,687 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 80 states. [2022-04-28 09:00:34,687 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 80 states. [2022-04-28 09:00:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:34,689 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-28 09:00:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-28 09:00:34,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:34,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:34,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:34,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:34,689 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 09:00:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-04-28 09:00:34,691 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 28 [2022-04-28 09:00:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:34,691 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-04-28 09:00:34,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:34,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 59 transitions. [2022-04-28 09:00:34,762 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 09:00:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-04-28 09:00:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 09:00:34,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:34,763 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 09:00:34,779 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 09:00:34,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:34,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 5 times [2022-04-28 09:00:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105665247] [2022-04-28 09:00:34,968 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:34,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 6 times [2022-04-28 09:00:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:34,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610059412] [2022-04-28 09:00:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:34,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:35,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {2827#(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); {2816#true} is VALID [2022-04-28 09:00:35,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {2816#true} assume true; {2816#true} is VALID [2022-04-28 09:00:35,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2816#true} {2816#true} #87#return; {2816#true} is VALID [2022-04-28 09:00:35,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:35,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {2827#(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); {2816#true} is VALID [2022-04-28 09:00:35,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2022-04-28 09:00:35,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #87#return; {2816#true} is VALID [2022-04-28 09:00:35,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret15 := main(); {2816#true} is VALID [2022-04-28 09:00:35,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {2816#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {2821#(= main_~j~0 0)} is VALID [2022-04-28 09:00:35,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {2821#(= 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; {2821#(= main_~j~0 0)} is VALID [2022-04-28 09:00:35,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {2821#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2822#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:35,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#(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; {2822#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:35,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:35,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2824#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:35,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {2824#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:35,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:35,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} #t~short10 := ~i~0 >= 0; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:35,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:35,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:35,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:35,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2826#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:35,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {2826#(<= (+ 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; {2817#false} is VALID [2022-04-28 09:00:35,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#false} #t~short10 := ~i~0 >= 0; {2817#false} is VALID [2022-04-28 09:00:35,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#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; {2817#false} is VALID [2022-04-28 09:00:35,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {2817#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {2817#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {2817#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#false} ~k~0 := 1; {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#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); {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L272 TraceCheckUtils]: 27: Hoare triple {2817#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {2817#false} ~cond := #in~cond; {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {2817#false} assume 0 == ~cond; {2817#false} is VALID [2022-04-28 09:00:35,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2022-04-28 09:00:35,123 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 09:00:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:35,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610059412] [2022-04-28 09:00:35,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610059412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:35,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672273628] [2022-04-28 09:00:35,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:35,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:35,125 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 09:00:35,171 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 09:00:35,195 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:35,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:35,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:00:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:35,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:37,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2816#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2816#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); {2816#true} is VALID [2022-04-28 09:00:37,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2022-04-28 09:00:37,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #87#return; {2816#true} is VALID [2022-04-28 09:00:37,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret15 := main(); {2816#true} is VALID [2022-04-28 09:00:37,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {2816#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {2821#(= main_~j~0 0)} is VALID [2022-04-28 09:00:37,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {2821#(= 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; {2821#(= main_~j~0 0)} is VALID [2022-04-28 09:00:37,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {2821#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2822#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:37,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#(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; {2822#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:37,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:37,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2824#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:37,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {2824#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:37,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:37,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} #t~short10 := ~i~0 >= 0; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:37,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:37,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:37,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:00:37,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {2825#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2882#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:00:37,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {2882#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= 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; {2817#false} is VALID [2022-04-28 09:00:37,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#false} #t~short10 := ~i~0 >= 0; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#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; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {2817#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {2817#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {2817#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#false} ~k~0 := 1; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#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); {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L272 TraceCheckUtils]: 27: Hoare triple {2817#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {2817#false} ~cond := #in~cond; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {2817#false} assume 0 == ~cond; {2817#false} is VALID [2022-04-28 09:00:37,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2022-04-28 09:00:37,165 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 09:00:37,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:38,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2022-04-28 09:00:38,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {2817#false} assume 0 == ~cond; {2817#false} is VALID [2022-04-28 09:00:38,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {2817#false} ~cond := #in~cond; {2817#false} is VALID [2022-04-28 09:00:38,220 INFO L272 TraceCheckUtils]: 27: Hoare triple {2817#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2817#false} is VALID [2022-04-28 09:00:38,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#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); {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#false} ~k~0 := 1; {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {2817#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {2817#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {2817#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#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; {2817#false} is VALID [2022-04-28 09:00:38,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#false} #t~short10 := ~i~0 >= 0; {2817#false} is VALID [2022-04-28 09:00:38,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {2826#(<= (+ 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; {2817#false} is VALID [2022-04-28 09:00:38,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {2961#(<= (+ 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; {2826#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:38,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {2961#(<= (+ 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); {2961#(<= (+ 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 09:00:38,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {2961#(<= (+ 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; {2961#(<= (+ 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 09:00:38,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {2961#(<= (+ 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; {2961#(<= (+ 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 09:00:38,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {2961#(<= (+ 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; {2961#(<= (+ 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 09:00:38,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {2961#(<= (+ 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; {2961#(<= (+ 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 09:00:38,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {2824#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {2961#(<= (+ 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 09:00:38,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {2983#(<= 0 (+ 1 (div (+ (- 4294967294) (* (- 1) (mod main_~j~0 4294967296))) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2824#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:38,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {2987#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2983#(<= 0 (+ 1 (div (+ (- 4294967294) (* (- 1) (mod main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:00:38,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {2987#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 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; {2987#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:38,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {2994#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2987#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:38,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {2994#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 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; {2994#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:38,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {2816#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {2994#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:38,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret15 := main(); {2816#true} is VALID [2022-04-28 09:00:38,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #87#return; {2816#true} is VALID [2022-04-28 09:00:38,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2022-04-28 09:00:38,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {2816#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); {2816#true} is VALID [2022-04-28 09:00:38,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2816#true} is VALID [2022-04-28 09:00:38,234 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 09:00:38,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672273628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:38,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:38,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-28 09:00:38,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:38,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105665247] [2022-04-28 09:00:38,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105665247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:38,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:38,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376261074] [2022-04-28 09:00:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:38,235 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 09:00:38,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:38,235 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 09:00:38,255 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 09:00:38,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:00:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:00:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:38,256 INFO L87 Difference]: Start difference. First operand 50 states and 59 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 09:00:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:39,168 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2022-04-28 09:00:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:00:39,169 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 09:00:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:39,169 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 09:00:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-28 09:00:39,174 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 09:00:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-28 09:00:39,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2022-04-28 09:00:39,258 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 09:00:39,260 INFO L225 Difference]: With dead ends: 125 [2022-04-28 09:00:39,260 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 09:00:39,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:00:39,261 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:39,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 60 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 09:00:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-28 09:00:39,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:39,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 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 09:00:39,402 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 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 09:00:39,404 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 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 09:00:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:39,413 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-28 09:00:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-28 09:00:39,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:39,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:39,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 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 91 states. [2022-04-28 09:00:39,414 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 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 91 states. [2022-04-28 09:00:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:39,416 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-28 09:00:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-28 09:00:39,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:39,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:39,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:39,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 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 09:00:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-04-28 09:00:39,418 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 31 [2022-04-28 09:00:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:39,418 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-04-28 09:00:39,418 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 09:00:39,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 74 transitions. [2022-04-28 09:00:39,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-28 09:00:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:00:39,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:39,522 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 09:00:39,544 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 09:00:39,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:39,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 1 times [2022-04-28 09:00:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307106379] [2022-04-28 09:00:39,748 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:39,749 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 2 times [2022-04-28 09:00:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:39,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671440147] [2022-04-28 09:00:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:39,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {3604#(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); {3588#true} is VALID [2022-04-28 09:00:39,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:39,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3588#true} {3588#true} #87#return; {3588#true} is VALID [2022-04-28 09:00:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:00:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:39,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {3588#true} ~cond := #in~cond; {3588#true} is VALID [2022-04-28 09:00:39,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {3588#true} assume !(0 == ~cond); {3588#true} is VALID [2022-04-28 09:00:39,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:39,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3588#true} {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #85#return; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:39,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {3588#true} call ULTIMATE.init(); {3604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:39,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#(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); {3588#true} is VALID [2022-04-28 09:00:39,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:39,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3588#true} {3588#true} #87#return; {3588#true} is VALID [2022-04-28 09:00:39,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {3588#true} call #t~ret15 := main(); {3588#true} is VALID [2022-04-28 09:00:39,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {3588#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {3593#(= main_~j~0 0)} is VALID [2022-04-28 09:00:39,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {3593#(= 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; {3593#(= main_~j~0 0)} is VALID [2022-04-28 09:00:39,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {3593#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3594#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:39,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {3594#(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; {3594#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:39,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {3594#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3595#(and (<= main_~j~0 2) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2022-04-28 09:00:39,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {3595#(and (<= main_~j~0 2) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:39,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:39,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(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; {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:39,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:39,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {3597#(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; {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:39,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {3597#(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; {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:39,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {3597#(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); {3597#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:39,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {3597#(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; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:39,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:39,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:39,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} 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); {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:39,983 INFO L272 TraceCheckUtils]: 21: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3588#true} is VALID [2022-04-28 09:00:39,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {3588#true} ~cond := #in~cond; {3588#true} is VALID [2022-04-28 09:00:39,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {3588#true} assume !(0 == ~cond); {3588#true} is VALID [2022-04-28 09:00:39,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:39,984 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3588#true} {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #85#return; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:39,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:39,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3603#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:39,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {3603#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ 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); {3589#false} is VALID [2022-04-28 09:00:39,987 INFO L272 TraceCheckUtils]: 29: Hoare triple {3589#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3589#false} is VALID [2022-04-28 09:00:39,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {3589#false} ~cond := #in~cond; {3589#false} is VALID [2022-04-28 09:00:39,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#false} assume 0 == ~cond; {3589#false} is VALID [2022-04-28 09:00:39,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#false} assume !false; {3589#false} is VALID [2022-04-28 09:00:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:39,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671440147] [2022-04-28 09:00:39,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671440147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:39,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958752126] [2022-04-28 09:00:39,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:39,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:39,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:39,990 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 09:00:40,017 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 09:00:40,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:40,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:40,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:00:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:40,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:43,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {3588#true} call ULTIMATE.init(); {3588#true} is VALID [2022-04-28 09:00:43,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {3588#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); {3588#true} is VALID [2022-04-28 09:00:43,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:43,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3588#true} {3588#true} #87#return; {3588#true} is VALID [2022-04-28 09:00:43,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {3588#true} call #t~ret15 := main(); {3588#true} is VALID [2022-04-28 09:00:43,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {3588#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {3593#(= main_~j~0 0)} is VALID [2022-04-28 09:00:43,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {3593#(= 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; {3593#(= main_~j~0 0)} is VALID [2022-04-28 09:00:43,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {3593#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3594#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:43,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {3594#(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; {3594#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:43,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {3594#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3635#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:43,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {3635#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(<= 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; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {3596#(<= 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; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {3596#(<= 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); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:43,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} 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); {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:43,350 INFO L272 TraceCheckUtils]: 21: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3588#true} is VALID [2022-04-28 09:00:43,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {3588#true} ~cond := #in~cond; {3588#true} is VALID [2022-04-28 09:00:43,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {3588#true} assume !(0 == ~cond); {3588#true} is VALID [2022-04-28 09:00:43,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:43,350 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3588#true} {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #85#return; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:43,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:43,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {3598#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3690#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~k~0 2))} is VALID [2022-04-28 09:00:43,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {3690#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~k~0 2))} 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); {3589#false} is VALID [2022-04-28 09:00:43,352 INFO L272 TraceCheckUtils]: 29: Hoare triple {3589#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3589#false} is VALID [2022-04-28 09:00:43,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {3589#false} ~cond := #in~cond; {3589#false} is VALID [2022-04-28 09:00:43,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#false} assume 0 == ~cond; {3589#false} is VALID [2022-04-28 09:00:43,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#false} assume !false; {3589#false} is VALID [2022-04-28 09:00:43,353 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 09:00:43,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:43,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#false} assume !false; {3589#false} is VALID [2022-04-28 09:00:43,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#false} assume 0 == ~cond; {3589#false} is VALID [2022-04-28 09:00:43,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3589#false} ~cond := #in~cond; {3589#false} is VALID [2022-04-28 09:00:43,811 INFO L272 TraceCheckUtils]: 29: Hoare triple {3589#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3589#false} is VALID [2022-04-28 09:00:43,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {3603#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ 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); {3589#false} is VALID [2022-04-28 09:00:43,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3603#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} havoc #t~mem13;havoc #t~mem14; {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:43,814 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3588#true} {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #85#return; {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:43,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:43,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {3588#true} assume !(0 == ~cond); {3588#true} is VALID [2022-04-28 09:00:43,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {3588#true} ~cond := #in~cond; {3588#true} is VALID [2022-04-28 09:00:43,814 INFO L272 TraceCheckUtils]: 21: Hoare triple {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3588#true} is VALID [2022-04-28 09:00:43,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (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); {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:43,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3721#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:43,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {3596#(<= 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); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {3596#(<= 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; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(<= 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; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {3773#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3596#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:43,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {3777#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3773#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-28 09:00:43,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {3777#(<= 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; {3777#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 09:00:43,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {3784#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3777#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 09:00:43,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {3784#(<= 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; {3784#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 09:00:43,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {3588#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {3784#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 09:00:43,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {3588#true} call #t~ret15 := main(); {3588#true} is VALID [2022-04-28 09:00:43,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3588#true} {3588#true} #87#return; {3588#true} is VALID [2022-04-28 09:00:43,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {3588#true} assume true; {3588#true} is VALID [2022-04-28 09:00:43,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {3588#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); {3588#true} is VALID [2022-04-28 09:00:43,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {3588#true} call ULTIMATE.init(); {3588#true} is VALID [2022-04-28 09:00:43,822 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 09:00:43,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958752126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:43,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:43,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-28 09:00:43,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:43,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307106379] [2022-04-28 09:00:43,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307106379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:43,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:43,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:00:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98254556] [2022-04-28 09:00:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:43,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:43,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:43,852 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 09:00:43,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:00:43,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:43,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:00:43,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:00:43,853 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,746 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2022-04-28 09:00:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:00:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 09:00:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 09:00:44,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-28 09:00:44,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:44,845 INFO L225 Difference]: With dead ends: 100 [2022-04-28 09:00:44,845 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 09:00:44,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:00:44,845 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 95 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:44,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 53 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 09:00:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2022-04-28 09:00:44,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:44,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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 09:00:44,953 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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 09:00:44,958 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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 09:00:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,988 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 09:00:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 09:00:44,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:44,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:44,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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 73 states. [2022-04-28 09:00:44,991 INFO L87 Difference]: Start difference. First operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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 73 states. [2022-04-28 09:00:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,992 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 09:00:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-04-28 09:00:44,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:44,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:44,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:44,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 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 09:00:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 09:00:44,995 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 33 [2022-04-28 09:00:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:44,996 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 09:00:44,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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 09:00:44,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 09:00:45,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 09:00:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:00:45,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:45,077 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 09:00:45,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:45,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:45,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 7 times [2022-04-28 09:00:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847568255] [2022-04-28 09:00:45,300 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:45,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 8 times [2022-04-28 09:00:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021607510] [2022-04-28 09:00:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:45,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {4305#(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); {4284#true} is VALID [2022-04-28 09:00:45,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {4284#true} assume true; {4284#true} is VALID [2022-04-28 09:00:45,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4284#true} {4284#true} #87#return; {4284#true} is VALID [2022-04-28 09:00:45,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {4284#true} call ULTIMATE.init(); {4305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:45,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#(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); {4284#true} is VALID [2022-04-28 09:00:45,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {4284#true} assume true; {4284#true} is VALID [2022-04-28 09:00:45,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4284#true} {4284#true} #87#return; {4284#true} is VALID [2022-04-28 09:00:45,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {4284#true} call #t~ret15 := main(); {4284#true} is VALID [2022-04-28 09:00:45,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {4284#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {4289#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {4289#(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; {4289#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {4289#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4290#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:45,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {4290#(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; {4290#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:45,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {4290#(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; {4291#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-28 09:00:45,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {4291#(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; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {4292#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {4292#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {4292#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4290#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:45,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {4290#(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; {4293#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:00:45,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {4293#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {4294#(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 09:00:45,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {4294#(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; {4295#(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 09:00:45,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#(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; {4296#(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 09:00:45,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {4296#(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); {4297#(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 09:00:45,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {4297#(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; {4298#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~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 09:00:45,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {4298#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~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);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; {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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 09:00:45,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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 09:00:45,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |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; {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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 09:00:45,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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 09:00:45,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {4299#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (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); {4300#(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 09:00:45,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {4300#(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; {4300#(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 09:00:45,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {4300#(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); {4300#(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 09:00:45,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {4300#(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; {4301#(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 09:00:45,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {4301#(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); {4302#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:45,897 INFO L272 TraceCheckUtils]: 29: Hoare triple {4302#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4303#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:45,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {4303#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4304#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:45,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {4304#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4285#false} is VALID [2022-04-28 09:00:45,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {4285#false} assume !false; {4285#false} is VALID [2022-04-28 09:00:45,898 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 09:00:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:45,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021607510] [2022-04-28 09:00:45,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021607510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:45,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947942708] [2022-04-28 09:00:45,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:45,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:45,899 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 09:00:45,900 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 09:00:45,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:45,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:45,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 09:00:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:45,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:46,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:46,300 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 09:00:46,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:46,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:46,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:46,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:46,482 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 30 treesize of output 32 [2022-04-28 09:00:46,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:46,593 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 09:00:46,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {4284#true} call ULTIMATE.init(); {4284#true} is VALID [2022-04-28 09:00:46,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {4284#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); {4284#true} is VALID [2022-04-28 09:00:46,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {4284#true} assume true; {4284#true} is VALID [2022-04-28 09:00:46,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4284#true} {4284#true} #87#return; {4284#true} is VALID [2022-04-28 09:00:46,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {4284#true} call #t~ret15 := main(); {4284#true} is VALID [2022-04-28 09:00:46,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {4284#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {4292#(= |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; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {4292#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {4292#(= |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; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {4292#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {4292#(= |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; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {4292#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {4292#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4292#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:46,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {4292#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4290#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:46,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {4290#(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; {4293#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:00:46,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {4293#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {4354#(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 09:00:46,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {4354#(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; {4295#(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 09:00:46,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#(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; {4296#(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 09:00:46,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {4296#(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); {4297#(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 09:00:46,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {4297#(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; {4298#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~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 09:00:46,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {4298#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~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);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; {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~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 09:00:46,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~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 09:00:46,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |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; {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~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 09:00:46,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~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 09:00:46,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {4370#(and (= |main_~#v~0.offset| 0) (<= 1 main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (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); {4300#(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 09:00:46,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {4300#(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; {4300#(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 09:00:46,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {4300#(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); {4300#(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 09:00:46,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {4300#(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; {4301#(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 09:00:46,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {4301#(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); {4302#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:46,682 INFO L272 TraceCheckUtils]: 29: Hoare triple {4302#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:46,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {4398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:46,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {4402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4285#false} is VALID [2022-04-28 09:00:46,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {4285#false} assume !false; {4285#false} is VALID [2022-04-28 09:00:46,683 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 09:00:46,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:50,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_18 Int)) (or (not (<= c_main_~j~0 (+ v_main_~i~0_18 1))) (forall ((v_ArrVal_137 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |c_main_~#v~0.offset| 4) v_ArrVal_137))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4))))))) is different from false [2022-04-28 09:00:58,776 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 09:00:58,841 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 09:00:58,842 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 09:01:56,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {4285#false} assume !false; {4285#false} is VALID [2022-04-28 09:01:56,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {4402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4285#false} is VALID [2022-04-28 09:01:56,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {4398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:56,328 INFO L272 TraceCheckUtils]: 29: Hoare triple {4302#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:56,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {4421#(<= (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); {4302#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:01:56,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {4425#(<= (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; {4421#(<= (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 09:01:56,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {4425#(<= (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); {4425#(<= (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 09:01:56,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {4425#(<= (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; {4425#(<= (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 09:01:56,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4425#(<= (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 09:01:56,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:01:56,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |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; {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:01:56,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:01:56,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {4448#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 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; {4435#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:01:56,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {4452#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4448#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 1)))))} is VALID [2022-04-28 09:01:56,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {4456#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4452#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-28 09:01:56,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {4460#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4456#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-28 09:01:56,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {4464#(or (not |main_#t~short10|) (and (< 0 main_~j~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; {4460#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} is VALID [2022-04-28 09:01:56,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {4468#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4464#(or (not |main_#t~short10|) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:01:56,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {4472#(<= 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; {4468#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:01:56,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {4284#true} ~j~0 := 1; {4472#(<= main_~j~0 1)} is VALID [2022-04-28 09:01:56,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {4284#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4284#true} is VALID [2022-04-28 09:01:56,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {4284#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4284#true} is VALID [2022-04-28 09:01:56,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {4284#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; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {4284#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {4284#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; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {4284#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {4284#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; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {4284#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {4284#true} call #t~ret15 := main(); {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4284#true} {4284#true} #87#return; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {4284#true} assume true; {4284#true} is VALID [2022-04-28 09:01:56,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {4284#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); {4284#true} is VALID [2022-04-28 09:01:56,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {4284#true} call ULTIMATE.init(); {4284#true} is VALID [2022-04-28 09:01:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-04-28 09:01:56,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947942708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:56,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:56,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 33 [2022-04-28 09:01:56,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847568255] [2022-04-28 09:01:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847568255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:56,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 09:01:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493059155] [2022-04-28 09:01:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:56,342 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 09:01:56,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:56,343 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 09:01:56,360 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 09:01:56,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 09:01:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:56,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 09:01:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=845, Unknown=11, NotChecked=60, Total=1056 [2022-04-28 09:01:56,363 INFO L87 Difference]: Start difference. First operand 58 states and 67 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 09:01:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:57,905 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2022-04-28 09:01:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 09:01:57,905 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 09:01:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:57,905 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 09:01:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 88 transitions. [2022-04-28 09:01:57,908 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 09:01:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 88 transitions. [2022-04-28 09:01:57,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 88 transitions. [2022-04-28 09:01:57,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:57,968 INFO L225 Difference]: With dead ends: 106 [2022-04-28 09:01:57,968 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 09:01:57,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=380, Invalid=2063, Unknown=11, NotChecked=96, Total=2550 [2022-04-28 09:01:57,970 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 147 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:57,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 61 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:01:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 09:01:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 68. [2022-04-28 09:01:58,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:58,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:01:58,124 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:01:58,124 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:01:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:58,133 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-28 09:01:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-04-28 09:01:58,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:58,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:58,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 104 states. [2022-04-28 09:01:58,134 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 104 states. [2022-04-28 09:01:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:58,142 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-28 09:01:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-04-28 09:01:58,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:58,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:58,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:58,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:01:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-04-28 09:01:58,143 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 33 [2022-04-28 09:01:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:58,144 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-04-28 09:01:58,144 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 09:01:58,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 81 transitions. [2022-04-28 09:01:58,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-28 09:01:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 09:01:58,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:58,284 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] [2022-04-28 09:01:58,306 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 09:01:58,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:58,484 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 1 times [2022-04-28 09:01:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:58,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381772233] [2022-04-28 09:01:58,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:58,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 2 times [2022-04-28 09:01:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:58,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845859869] [2022-04-28 09:01:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {5127#(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); {5109#true} is VALID [2022-04-28 09:01:58,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 09:01:58,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5109#true} {5109#true} #87#return; {5109#true} is VALID [2022-04-28 09:01:58,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:58,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {5127#(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); {5109#true} is VALID [2022-04-28 09:01:58,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 09:01:58,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #87#return; {5109#true} is VALID [2022-04-28 09:01:58,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret15 := main(); {5109#true} is VALID [2022-04-28 09:01:58,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {5114#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:01:58,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {5114#(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; {5114#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:01:58,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {5114#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {5115#(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; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {5115#(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; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:58,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {5116#(= |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; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:58,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {5116#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:58,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {5116#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:58,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {5116#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {5115#(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; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {5115#(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; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {5115#(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); {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:58,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {5115#(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; {5117#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-28 09:01:58,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {5117#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} 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; {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:58,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:58,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {5118#(and (= |main_~#v~0.offset| 0) (= 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; {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:58,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {5119#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:58,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {5119#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5119#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:58,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {5119#(and (= |main_~#v~0.offset| 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; {5120#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (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 09:01:58,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {5120#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (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; {5121#(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 09:01:58,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {5121#(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); {5122#(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 09:01:58,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {5122#(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; {5122#(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 09:01:58,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {5122#(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); {5122#(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 09:01:58,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {5122#(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; {5123#(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 09:01:58,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {5123#(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); {5124#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:01:58,854 INFO L272 TraceCheckUtils]: 32: Hoare triple {5124#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5125#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:58,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {5125#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5126#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:58,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {5126#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5110#false} is VALID [2022-04-28 09:01:58,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-28 09:01:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:01:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:58,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845859869] [2022-04-28 09:01:58,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845859869] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:58,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435357553] [2022-04-28 09:01:58,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:58,856 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 09:01:58,857 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 09:01:58,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:58,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:58,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:01:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:58,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:59,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:01:59,265 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 09:01:59,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:01:59,376 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 09:01:59,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2022-04-28 09:01:59,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#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); {5109#true} is VALID [2022-04-28 09:01:59,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 09:01:59,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #87#return; {5109#true} is VALID [2022-04-28 09:01:59,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret15 := main(); {5109#true} is VALID [2022-04-28 09:01:59,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {5116#(= |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; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {5116#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {5116#(= |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; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {5116#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {5116#(= |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; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {5116#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {5116#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5116#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:59,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {5116#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:59,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {5115#(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; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:59,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:59,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {5115#(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; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:59,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:59,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {5115#(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); {5115#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:59,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {5115#(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; {5117#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-28 09:01:59,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {5117#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} 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; {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:59,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:59,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {5118#(and (= |main_~#v~0.offset| 0) (= 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; {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:59,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {5118#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {5119#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:01:59,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {5119#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5203#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)) |main_#t~short10|)} is VALID [2022-04-28 09:01:59,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {5203#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 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; {5120#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (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 09:01:59,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {5120#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (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; {5121#(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 09:01:59,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {5121#(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); {5122#(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 09:01:59,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {5122#(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; {5122#(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 09:01:59,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {5122#(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); {5122#(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 09:01:59,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {5122#(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; {5123#(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 09:01:59,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {5123#(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); {5124#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:01:59,459 INFO L272 TraceCheckUtils]: 32: Hoare triple {5124#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:59,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {5228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:59,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {5232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5110#false} is VALID [2022-04-28 09:01:59,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-28 09:01:59,460 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 09:01:59,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:59,798 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 09:01:59,831 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 09:01:59,831 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 09:02:00,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-28 09:02:00,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {5232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5110#false} is VALID [2022-04-28 09:02:00,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {5228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:00,099 INFO L272 TraceCheckUtils]: 32: Hoare triple {5124#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:02:00,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {5251#(<= (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); {5124#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:02:00,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#(<= (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; {5251#(<= (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 09:02:00,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {5255#(<= (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); {5255#(<= (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 09:02:00,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {5255#(<= (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; {5255#(<= (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 09:02:00,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {5265#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5255#(<= (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 09:02:00,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {5269#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5265#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:02:00,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {5273#(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; {5269#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:02:00,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {5277#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5273#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:02:00,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {5281#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {5277#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:02:00,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {5281#(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; {5281#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:02:00,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {5281#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} #t~short10 := ~i~0 >= 0; {5281#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:02:00,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {5291#(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; {5281#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:02:00,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5291#(or (= (+ (* main_~j~0 4) (- 8)) 0) (not (<= 2 main_~j~0)))} is VALID [2022-04-28 09:02:00,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#(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); {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:02:00,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:02:00,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {5295#(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; {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:02:00,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~short10 := ~i~0 >= 0; {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:02:00,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#(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; {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {5109#true} ~j~0 := 1; {5295#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {5109#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {5109#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {5109#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; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {5109#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {5109#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; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {5109#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {5109#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; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret15 := main(); {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #87#return; {5109#true} is VALID [2022-04-28 09:02:00,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 09:02:00,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#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); {5109#true} is VALID [2022-04-28 09:02:00,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2022-04-28 09:02:00,109 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 09:02:00,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435357553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:00,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:00,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 28 [2022-04-28 09:02:00,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:00,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381772233] [2022-04-28 09:02:00,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381772233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:00,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:00,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:02:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868263116] [2022-04-28 09:02:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:00,110 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 09:02:00,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:00,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:00,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:00,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:02:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:02:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:02:00,138 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:02,808 INFO L93 Difference]: Finished difference Result 170 states and 221 transitions. [2022-04-28 09:02:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 09:02:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 09:02:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 139 transitions. [2022-04-28 09:02:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 139 transitions. [2022-04-28 09:02:02,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 139 transitions. [2022-04-28 09:02:02,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:02,950 INFO L225 Difference]: With dead ends: 170 [2022-04-28 09:02:02,951 INFO L226 Difference]: Without dead ends: 168 [2022-04-28 09:02:02,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 09:02:02,952 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 180 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:02,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 70 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 09:02:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-28 09:02:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 83. [2022-04-28 09:02:03,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:03,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 83 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 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 09:02:03,242 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 83 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 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 09:02:03,242 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 83 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 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 09:02:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:03,252 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2022-04-28 09:02:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2022-04-28 09:02:03,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:03,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:03,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 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 168 states. [2022-04-28 09:02:03,254 INFO L87 Difference]: Start difference. First operand has 83 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 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 168 states. [2022-04-28 09:02:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:03,271 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2022-04-28 09:02:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2022-04-28 09:02:03,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:03,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:03,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:03,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 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 09:02:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2022-04-28 09:02:03,273 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 36 [2022-04-28 09:02:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:03,273 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2022-04-28 09:02:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:02:03,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 107 transitions. [2022-04-28 09:02:03,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2022-04-28 09:02:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 09:02:03,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:03,469 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] [2022-04-28 09:02:03,493 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 09:02:03,670 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,SelfDestructingSolverStorable10 [2022-04-28 09:02:03,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 3 times [2022-04-28 09:02:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:03,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205509074] [2022-04-28 09:02:03,676 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:02:03,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 4 times [2022-04-28 09:02:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:03,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569771790] [2022-04-28 09:02:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:04,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {6278#(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); {6255#true} is VALID [2022-04-28 09:02:04,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {6255#true} assume true; {6255#true} is VALID [2022-04-28 09:02:04,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6255#true} {6255#true} #87#return; {6255#true} is VALID [2022-04-28 09:02:04,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {6255#true} call ULTIMATE.init(); {6278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:04,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {6278#(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); {6255#true} is VALID [2022-04-28 09:02:04,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {6255#true} assume true; {6255#true} is VALID [2022-04-28 09:02:04,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6255#true} {6255#true} #87#return; {6255#true} is VALID [2022-04-28 09:02:04,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {6255#true} call #t~ret15 := main(); {6255#true} is VALID [2022-04-28 09:02:04,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {6255#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {6260#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:02:04,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {6260#(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; {6260#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:02:04,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {6260#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6261#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:02:04,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {6261#(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; {6261#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:02:04,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {6261#(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; {6262#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:02:04,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {6262#(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; {6262#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:02:04,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {6262#(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; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:04,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {6263#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:04,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {6263#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {6261#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:02:04,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {6261#(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; {6264#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:02:04,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {6264#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {6265#(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 09:02:04,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {6265#(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; {6266#(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 09:02:04,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {6266#(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;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;~i~0 := ~i~0 - 1; {6267#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ 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)) (not (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:02:04,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {6267#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ 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)) (not (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {6268#(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 09:02:04,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {6268#(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; {6269#(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 09:02:04,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {6269#(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; {6269#(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 09:02:04,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {6269#(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); {6270#(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 09:02:04,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(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; {6271#(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 09:02:04,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {6271#(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; {6272#(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 09:02:04,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {6272#(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; {6272#(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 09:02:04,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {6272#(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; {6272#(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 09:02:04,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {6272#(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; {6272#(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 09:02:04,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {6272#(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); {6273#(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 09:02:04,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {6273#(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; {6273#(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 09:02:04,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {6273#(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); {6273#(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 09:02:04,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {6273#(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; {6274#(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 09:02:04,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#(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); {6275#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:02:04,264 INFO L272 TraceCheckUtils]: 32: Hoare triple {6275#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6276#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:04,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {6276#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6277#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:02:04,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {6277#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6256#false} is VALID [2022-04-28 09:02:04,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {6256#false} assume !false; {6256#false} is VALID [2022-04-28 09:02:04,265 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 09:02:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:04,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569771790] [2022-04-28 09:02:04,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569771790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:04,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152841184] [2022-04-28 09:02:04,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:02:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:04,270 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 09:02:04,271 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 09:02:04,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:02:04,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:04,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:02:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:04,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:04,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:04,552 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 39 treesize of output 30 [2022-04-28 09:02:05,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:05,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:02:05,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:02:05,127 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 48 treesize of output 42 [2022-04-28 09:02:05,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:05,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:05,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:02:05,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:02:05,473 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 09:02:05,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:02:05,539 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 09:02:05,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {6255#true} call ULTIMATE.init(); {6255#true} is VALID [2022-04-28 09:02:05,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {6255#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); {6255#true} is VALID [2022-04-28 09:02:05,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {6255#true} assume true; {6255#true} is VALID [2022-04-28 09:02:05,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6255#true} {6255#true} #87#return; {6255#true} is VALID [2022-04-28 09:02:05,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {6255#true} call #t~ret15 := main(); {6255#true} is VALID [2022-04-28 09:02:05,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {6255#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {6263#(= |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; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {6263#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {6263#(= |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; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {6263#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {6263#(= |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; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {6263#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {6263#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6263#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:02:05,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {6263#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {6261#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:02:05,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {6261#(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; {6261#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:02:05,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {6261#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6327#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 09:02:05,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {6327#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (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; {6331#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~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) (<= main_~j~0 1))} is VALID [2022-04-28 09:02:05,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {6331#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~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) (<= main_~j~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {6335#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-28 09:02:05,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {6335#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} #t~short10 := ~i~0 >= 0; {6339#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 09:02:05,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {6339#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {6343#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-28 09:02:05,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {6343#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6343#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-28 09:02:05,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {6343#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6270#(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 09:02:05,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(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; {6353#(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 09:02:05,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {6353#(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; {6357#(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 09:02:05,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {6357#(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; {6357#(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 09:02:05,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {6357#(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;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6357#(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 09:02:05,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {6357#(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; {6357#(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 09:02:05,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {6357#(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); {6273#(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 09:02:05,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {6273#(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; {6273#(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 09:02:05,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {6273#(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); {6273#(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 09:02:05,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {6273#(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; {6274#(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 09:02:05,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#(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); {6275#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:02:05,658 INFO L272 TraceCheckUtils]: 32: Hoare triple {6275#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6385#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:02:05,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {6385#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6389#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:05,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {6389#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6256#false} is VALID [2022-04-28 09:02:05,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {6256#false} assume !false; {6256#false} is VALID [2022-04-28 09:02:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:02:05,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:17,410 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 85 treesize of output 77 [2022-04-28 09:02:17,517 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-28 09:02:17,517 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 11003 treesize of output 10617 [2022-04-28 09:08:33,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {6256#false} assume !false; {6256#false} is VALID [2022-04-28 09:08:33,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {6389#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6256#false} is VALID [2022-04-28 09:08:33,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {6385#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6389#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:08:33,250 INFO L272 TraceCheckUtils]: 32: Hoare triple {6405#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6385#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:08:33,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {6409#(<= (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); {6405#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:08:33,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {6413#(<= (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; {6409#(<= (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 09:08:33,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {6413#(<= (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); {6413#(<= (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 09:08:33,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {6413#(<= (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; {6413#(<= (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 09:08:33,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6413#(<= (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 09:08:33,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:08:33,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |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; {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:08:33,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:08:33,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {6436#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) (+ |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; {6423#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:08:33,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {6440#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6436#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:08:33,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {6444#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6440#(forall ((v_ArrVal_201 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:08:33,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {6444#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6444#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:08:33,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {6451#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {6444#(forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:08:33,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {6455#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {6451#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:08:33,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {6459#(or (not |main_#t~short10|) (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_198 Int) (v_main_~i~0_26 Int)) (or (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_26) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_198)) (not (<= v_ArrVal_200 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_26 1))))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {6455#(or (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int)) (or (not (<= v_ArrVal_200 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |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_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} is VALID [2022-04-28 09:08:33,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))) (<= 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; {6459#(or (not |main_#t~short10|) (forall ((v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_198 Int) (v_main_~i~0_26 Int)) (or (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) |main_~#v~0.offset|) (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_198) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_201) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_26) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_198)) (not (<= v_ArrVal_200 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_26 1))))))} is VALID [2022-04-28 09:08:33,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {6467#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} #t~short10 := ~i~0 >= 0; {6463#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))) (<= 1 main_~i~0))} is VALID [2022-04-28 09:08:33,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {6467#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* 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; {6467#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {6255#true} ~j~0 := 1; {6467#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {6255#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {6255#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {6255#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; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {6255#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {6255#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; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {6255#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {6255#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; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {6255#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {6255#true} call #t~ret15 := main(); {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6255#true} {6255#true} #87#return; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {6255#true} assume true; {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {6255#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); {6255#true} is VALID [2022-04-28 09:08:33,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {6255#true} call ULTIMATE.init(); {6255#true} is VALID [2022-04-28 09:08:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 1 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:33,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152841184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:08:33,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:08:33,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 16] total 42 [2022-04-28 09:08:33,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:08:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205509074] [2022-04-28 09:08:33,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205509074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:08:33,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:08:33,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 09:08:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880613748] [2022-04-28 09:08:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:08:33,268 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 09:08:33,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:08:33,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:08:33,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:33,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 09:08:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 09:08:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1517, Unknown=7, NotChecked=0, Total=1722 [2022-04-28 09:08:33,304 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:08:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:36,535 INFO L93 Difference]: Finished difference Result 195 states and 253 transitions. [2022-04-28 09:08:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 09:08:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 09:08:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:08:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:08:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 157 transitions. [2022-04-28 09:08:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:08:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 157 transitions. [2022-04-28 09:08:36,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 157 transitions. [2022-04-28 09:08:36,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:36,663 INFO L225 Difference]: With dead ends: 195 [2022-04-28 09:08:36,663 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 09:08:36,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=595, Invalid=4090, Unknown=7, NotChecked=0, Total=4692 [2022-04-28 09:08:36,665 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 138 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:08:36,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 86 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 09:08:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 09:08:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2022-04-28 09:08:36,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:08:36,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 102 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 95 states have internal predecessors, (125), 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 09:08:36,887 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 102 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 95 states have internal predecessors, (125), 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 09:08:36,887 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 102 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 95 states have internal predecessors, (125), 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 09:08:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:36,889 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2022-04-28 09:08:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-04-28 09:08:36,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:36,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:36,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 95 states have internal predecessors, (125), 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 09:08:36,890 INFO L87 Difference]: Start difference. First operand has 102 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 95 states have internal predecessors, (125), 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 09:08:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:36,892 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2022-04-28 09:08:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-04-28 09:08:36,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:36,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:36,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:08:36,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:08:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 95 states have internal predecessors, (125), 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 09:08:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2022-04-28 09:08:36,898 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 36 [2022-04-28 09:08:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:08:36,898 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2022-04-28 09:08:36,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:08:36,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 132 transitions. [2022-04-28 09:08:37,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2022-04-28 09:08:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:08:37,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:08:37,142 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:08:37,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 09:08:37,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:37,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:08:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:08:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1631396062, now seen corresponding path program 3 times [2022-04-28 09:08:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:37,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166411540] [2022-04-28 09:08:37,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:08:37,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:08:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1631396062, now seen corresponding path program 4 times [2022-04-28 09:08:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:08:37,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141026954] [2022-04-28 09:08:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:08:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:08:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:08:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:37,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {7488#(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); {7477#true} is VALID [2022-04-28 09:08:37,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-28 09:08:37,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7477#true} {7477#true} #87#return; {7477#true} is VALID [2022-04-28 09:08:37,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:08:37,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {7488#(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); {7477#true} is VALID [2022-04-28 09:08:37,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-28 09:08:37,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #87#return; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret15 := main(); {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7477#true} is VALID [2022-04-28 09:08:37,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#true} ~j~0 := 1; {7482#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:08:37,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {7482#(= (+ (- 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; {7482#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:08:37,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {7482#(= (+ (- 1) main_~j~0) 0)} #t~short10 := ~i~0 >= 0; {7482#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:08:37,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {7482#(= (+ (- 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; {7482#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:08:37,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {7482#(= (+ (- 1) main_~j~0) 0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7482#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:08:37,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {7482#(= (+ (- 1) main_~j~0) 0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7482#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:08:37,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {7482#(= (+ (- 1) main_~j~0) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7483#(<= main_~j~0 2)} is VALID [2022-04-28 09:08:37,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {7483#(<= 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; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {7484#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {7484#(<= 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; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {7484#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {7485#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {7485#(<= main_~i~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; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {7485#(<= main_~i~0 0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {7486#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-28 09:08:37,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {7486#(<= (+ main_~i~0 1) 0)} #t~short10 := ~i~0 >= 0; {7487#(not |main_#t~short10|)} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {7487#(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; {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {7478#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {7478#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {7478#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {7478#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {7478#false} ~k~0 := 1; {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {7478#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); {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L272 TraceCheckUtils]: 35: Hoare triple {7478#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-28 09:08:37,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-28 09:08:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:08:37,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141026954] [2022-04-28 09:08:37,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141026954] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:08:37,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520947392] [2022-04-28 09:08:37,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:08:37,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:37,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:08:37,430 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 09:08:37,432 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 09:08:37,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:08:37,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:08:37,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:08:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:37,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:08:37,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#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); {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #87#return; {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret15 := main(); {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7477#true} is VALID [2022-04-28 09:08:37,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#true} ~j~0 := 1; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {7531#(<= 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; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {7531#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {7531#(<= 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; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {7531#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {7531#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {7531#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7483#(<= main_~j~0 2)} is VALID [2022-04-28 09:08:37,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {7483#(<= 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; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {7484#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {7484#(<= 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; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {7484#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {7485#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {7485#(<= main_~i~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; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {7485#(<= main_~i~0 0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {7486#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-28 09:08:37,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {7486#(<= (+ main_~i~0 1) 0)} #t~short10 := ~i~0 >= 0; {7487#(not |main_#t~short10|)} is VALID [2022-04-28 09:08:37,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {7487#(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; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {7478#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {7478#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {7478#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {7478#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {7478#false} ~k~0 := 1; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {7478#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); {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L272 TraceCheckUtils]: 35: Hoare triple {7478#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-28 09:08:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:37,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:08:37,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-28 09:08:37,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-28 09:08:37,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-28 09:08:37,765 INFO L272 TraceCheckUtils]: 35: Hoare triple {7478#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7478#false} is VALID [2022-04-28 09:08:37,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {7478#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); {7478#false} is VALID [2022-04-28 09:08:37,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {7478#false} ~k~0 := 1; {7478#false} is VALID [2022-04-28 09:08:37,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {7478#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7478#false} is VALID [2022-04-28 09:08:37,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {7478#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7478#false} is VALID [2022-04-28 09:08:37,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {7478#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7478#false} is VALID [2022-04-28 09:08:37,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {7478#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7478#false} is VALID [2022-04-28 09:08:37,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {7487#(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; {7478#false} is VALID [2022-04-28 09:08:37,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {7486#(<= (+ main_~i~0 1) 0)} #t~short10 := ~i~0 >= 0; {7487#(not |main_#t~short10|)} is VALID [2022-04-28 09:08:37,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {7485#(<= main_~i~0 0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {7486#(<= (+ main_~i~0 1) 0)} is VALID [2022-04-28 09:08:37,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {7485#(<= main_~i~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; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {7485#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {7484#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {7485#(<= main_~i~0 0)} is VALID [2022-04-28 09:08:37,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {7484#(<= 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; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {7484#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {7483#(<= 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; {7484#(<= main_~i~0 1)} is VALID [2022-04-28 09:08:37,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {7531#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7483#(<= main_~j~0 2)} is VALID [2022-04-28 09:08:37,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {7531#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {7531#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {7531#(<= 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; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {7531#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {7531#(<= 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; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#true} ~j~0 := 1; {7531#(<= main_~j~0 1)} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {7477#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {7477#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; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret15 := main(); {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #87#return; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#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); {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7477#true} is VALID [2022-04-28 09:08:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:37,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520947392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:08:37,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:08:37,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-28 09:08:37,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:08:37,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166411540] [2022-04-28 09:08:37,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166411540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:08:37,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:08:37,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:08:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414345326] [2022-04-28 09:08:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:08:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 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 39 [2022-04-28 09:08:37,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:08:37,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 3 states 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 09:08:37,798 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 09:08:37,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:08:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:08:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:08:37,799 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 3 states 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 09:08:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:38,770 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2022-04-28 09:08:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 09:08:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 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 39 [2022-04-28 09:08:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:08:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 3 states 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 09:08:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 114 transitions. [2022-04-28 09:08:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 3 states 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 09:08:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 114 transitions. [2022-04-28 09:08:38,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 114 transitions. [2022-04-28 09:08:38,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:38,849 INFO L225 Difference]: With dead ends: 169 [2022-04-28 09:08:38,849 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 09:08:38,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:08:38,867 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 87 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:08:38,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 47 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:08:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 09:08:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2022-04-28 09:08:39,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:08:39,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:39,031 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:39,031 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:39,033 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-28 09:08:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2022-04-28 09:08:39,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:39,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:39,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 115 states. [2022-04-28 09:08:39,034 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 115 states. [2022-04-28 09:08:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:39,035 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-28 09:08:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2022-04-28 09:08:39,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:39,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:39,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:08:39,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:08:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-04-28 09:08:39,037 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 39 [2022-04-28 09:08:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:08:39,037 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-04-28 09:08:39,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 3 states 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 09:08:39,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 81 transitions. [2022-04-28 09:08:39,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-28 09:08:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:08:39,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:08:39,220 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:08:39,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 09:08:39,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 09:08:39,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:08:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:08:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash -930331484, now seen corresponding path program 5 times [2022-04-28 09:08:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:39,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366439962] [2022-04-28 09:08:39,432 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:08:39,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:08:39,432 INFO L85 PathProgramCache]: Analyzing trace with hash -930331484, now seen corresponding path program 6 times [2022-04-28 09:08:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:08:39,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183093715] [2022-04-28 09:08:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:08:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:08:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:08:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:39,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {8477#(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); {8457#true} is VALID [2022-04-28 09:08:39,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {8457#true} assume true; {8457#true} is VALID [2022-04-28 09:08:39,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8457#true} {8457#true} #87#return; {8457#true} is VALID [2022-04-28 09:08:39,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:08:39,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {8477#(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); {8457#true} is VALID [2022-04-28 09:08:39,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2022-04-28 09:08:39,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #87#return; {8457#true} is VALID [2022-04-28 09:08:39,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret15 := main(); {8457#true} is VALID [2022-04-28 09:08:39,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {8457#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {8462#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:08:39,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {8462#(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; {8462#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:08:39,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {8462#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {8463#(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; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {8463#(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; {8464#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:39,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {8464#(= |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; {8464#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:39,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {8464#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8464#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:39,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {8464#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8464#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:39,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {8464#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {8463#(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; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {8463#(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; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {8463#(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); {8463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:39,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {8463#(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; {8465#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-28 09:08:39,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {8465#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} 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; {8466#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:39,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {8466#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {8466#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:39,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {8466#(and (= |main_~#v~0.offset| 0) (= 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; {8466#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:39,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {8466#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {8467#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:39,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {8467#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {8467#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:39,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {8467#(and (= |main_~#v~0.offset| 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; {8468#(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))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:39,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {8468#(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))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {8469#(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 09:08:39,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {8469#(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; {8470#(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 09:08:39,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {8470#(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; {8471#(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 09:08:39,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {8471#(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; {8471#(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 09:08:39,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {8471#(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); {8472#(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 09:08:39,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {8472#(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; {8472#(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 09:08:39,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {8472#(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); {8472#(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 09:08:39,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {8472#(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; {8473#(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 09:08:39,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {8473#(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); {8474#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:08:39,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {8474#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:08:39,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {8475#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8476#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:08:39,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {8476#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8458#false} is VALID [2022-04-28 09:08:39,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2022-04-28 09:08:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:08:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:08:39,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183093715] [2022-04-28 09:08:39,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183093715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:08:39,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62865419] [2022-04-28 09:08:39,769 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:08:39,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:39,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:08:39,770 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:08:39,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 09:08:39,849 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:08:39,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:08:39,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:08:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:39,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:08:40,077 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 09:08:40,077 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 28 treesize of output 23 [2022-04-28 09:08:40,281 INFO L356 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-04-28 09:08:40,282 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 37 treesize of output 28 [2022-04-28 09:08:40,536 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-28 09:08:40,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 13 [2022-04-28 09:08:40,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2022-04-28 09:08:40,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {8457#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); {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #87#return; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret15 := main(); {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {8457#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {8457#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; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {8457#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {8457#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; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {8457#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8457#true} is VALID [2022-04-28 09:08:40,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {8457#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; {8457#true} is VALID [2022-04-28 09:08:40,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {8457#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8457#true} is VALID [2022-04-28 09:08:40,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {8457#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8457#true} is VALID [2022-04-28 09:08:40,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {8457#true} ~j~0 := 1; {8520#(= main_~j~0 1)} is VALID [2022-04-28 09:08:40,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {8520#(= 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; {8520#(= main_~j~0 1)} is VALID [2022-04-28 09:08:40,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {8520#(= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {8520#(= main_~j~0 1)} is VALID [2022-04-28 09:08:40,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {8520#(= 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; {8520#(= main_~j~0 1)} is VALID [2022-04-28 09:08:40,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {8520#(= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8520#(= main_~j~0 1)} is VALID [2022-04-28 09:08:40,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {8520#(= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8520#(= main_~j~0 1)} is VALID [2022-04-28 09:08:40,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {8520#(= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8539#(= (+ (- 1) main_~j~0) 1)} is VALID [2022-04-28 09:08:40,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {8539#(= (+ (- 1) 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; {8543#(= main_~i~0 1)} is VALID [2022-04-28 09:08:40,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {8543#(= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {8543#(= main_~i~0 1)} is VALID [2022-04-28 09:08:40,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {8543#(= 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; {8543#(= main_~i~0 1)} is VALID [2022-04-28 09:08:40,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {8543#(= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {8553#(= (+ main_~i~0 1) 1)} is VALID [2022-04-28 09:08:40,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {8553#(= (+ main_~i~0 1) 1)} #t~short10 := ~i~0 >= 0; {8553#(= (+ main_~i~0 1) 1)} is VALID [2022-04-28 09:08:40,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {8553#(= (+ main_~i~0 1) 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; {8560#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= (+ main_~i~0 1) 1))} is VALID [2022-04-28 09:08:40,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {8560#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= (+ main_~i~0 1) 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {8564#(and (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:08:40,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {8564#(and (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {8568#(and (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 09:08:40,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {8568#(and (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {8572#(and (< main_~i~0 0) (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:08:40,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {8572#(and (< main_~i~0 0) (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8572#(and (< main_~i~0 0) (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:08:40,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {8572#(and (< main_~i~0 0) (< main_~key~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|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8579#(exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-28 09:08:40,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {8579#(exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8579#(exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-28 09:08:40,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {8579#(exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8579#(exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1))))} is VALID [2022-04-28 09:08:40,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {8579#(exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1))))} ~k~0 := 1; {8589#(and (= main_~k~0 1) (exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~0 1)))))} is VALID [2022-04-28 09:08:40,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {8589#(and (= main_~k~0 1) (exists ((main_~i~0 Int)) (and (< 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| 4))) (<= 0 (+ main_~i~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); {8474#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:08:40,627 INFO L272 TraceCheckUtils]: 35: Hoare triple {8474#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8596#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:08:40,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {8596#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8600#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:08:40,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {8600#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8458#false} is VALID [2022-04-28 09:08:40,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2022-04-28 09:08:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:40,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:08:41,379 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 09:08:41,442 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-28 09:08:41,442 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 1439 treesize of output 1331 [2022-04-28 09:08:42,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2022-04-28 09:08:42,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {8600#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8458#false} is VALID [2022-04-28 09:08:42,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {8596#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8600#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:08:42,396 INFO L272 TraceCheckUtils]: 35: Hoare triple {8616#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8596#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:08:42,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {8620#(<= (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); {8616#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:08:42,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {8624#(<= (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; {8620#(<= (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 09:08:42,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {8624#(<= (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); {8624#(<= (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 09:08:42,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {8624#(<= (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; {8624#(<= (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 09:08:42,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {8634#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8624#(<= (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 09:08:42,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {8634#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8634#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} is VALID [2022-04-28 09:08:42,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {8641#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) |main_#t~short10|)} assume !#t~short10; {8634#(forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0))))} is VALID [2022-04-28 09:08:42,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {8645#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {8641#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) |main_#t~short10|)} is VALID [2022-04-28 09:08:42,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {8649#(or (not |main_#t~short10|) (forall ((v_ArrVal_269 Int) (v_ArrVal_267 Int) (v_main_~i~0_36 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) |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_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_36) (not (<= main_~i~0 (+ v_main_~i~0_36 1))) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_267)) (not (<= v_ArrVal_269 main_~key~0)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {8645#(or (forall ((v_ArrVal_269 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_269 main_~key~0)))) (<= 0 main_~i~0))} is VALID [2022-04-28 09:08:42,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {8653#(or (<= 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; {8649#(or (not |main_#t~short10|) (forall ((v_ArrVal_269 Int) (v_ArrVal_267 Int) (v_main_~i~0_36 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) |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_267) (+ |main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_269) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_36) (not (<= main_~i~0 (+ v_main_~i~0_36 1))) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_267)) (not (<= v_ArrVal_269 main_~key~0)))))} is VALID [2022-04-28 09:08:42,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {8653#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {8653#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:42,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {8660#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {8653#(or (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:42,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {8660#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 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; {8660#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} is VALID [2022-04-28 09:08:42,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {8660#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} #t~short10 := ~i~0 >= 0; {8660#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} is VALID [2022-04-28 09:08:42,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {8670#(or (= (+ (* main_~j~0 4) (- 8)) 0) (<= 3 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; {8660#(or (= (+ (- 4) (* main_~i~0 4)) 0) (<= 2 main_~i~0))} is VALID [2022-04-28 09:08:42,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8670#(or (= (+ (* main_~j~0 4) (- 8)) 0) (<= 3 main_~j~0))} is VALID [2022-04-28 09:08:42,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {8674#(or (<= 2 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); {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:08:42,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:08:42,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {8674#(or (<= 2 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; {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:08:42,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~short10 := ~i~0 >= 0; {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {8674#(or (<= 2 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; {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {8457#true} ~j~0 := 1; {8674#(or (<= 2 main_~j~0) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {8457#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {8457#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {8457#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; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {8457#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {8457#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; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {8457#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {8457#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; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {8457#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {8457#true} is VALID [2022-04-28 09:08:42,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret15 := main(); {8457#true} is VALID [2022-04-28 09:08:42,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #87#return; {8457#true} is VALID [2022-04-28 09:08:42,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2022-04-28 09:08:42,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {8457#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); {8457#true} is VALID [2022-04-28 09:08:42,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2022-04-28 09:08:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:42,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62865419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:08:42,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:08:42,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 41 [2022-04-28 09:08:42,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:08:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1366439962] [2022-04-28 09:08:42,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1366439962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:08:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:08:42,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:08:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686405371] [2022-04-28 09:08:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:08:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-04-28 09:08:42,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:08:42,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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 09:08:42,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:42,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:08:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:08:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 09:08:42,441 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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 09:08:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:45,705 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2022-04-28 09:08:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 09:08:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-04-28 09:08:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:08:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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 09:08:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 135 transitions. [2022-04-28 09:08:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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 09:08:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 135 transitions. [2022-04-28 09:08:45,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 135 transitions. [2022-04-28 09:08:45,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:45,806 INFO L225 Difference]: With dead ends: 144 [2022-04-28 09:08:45,806 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 09:08:45,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=582, Invalid=4110, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 09:08:45,808 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 141 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:08:45,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 100 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 09:08:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 09:08:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 68. [2022-04-28 09:08:45,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:08:45,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:45,996 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:45,996 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:45,998 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2022-04-28 09:08:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-04-28 09:08:45,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:45,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:45,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 142 states. [2022-04-28 09:08:45,999 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 142 states. [2022-04-28 09:08:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:46,000 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2022-04-28 09:08:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-04-28 09:08:46,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:46,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:46,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:08:46,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:08:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 61 states have internal predecessors, (74), 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 09:08:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-04-28 09:08:46,002 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 39 [2022-04-28 09:08:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:08:46,002 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-04-28 09:08:46,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states 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 09:08:46,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 81 transitions. [2022-04-28 09:08:46,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-28 09:08:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 09:08:46,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:08:46,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:08:46,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 09:08:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 09:08:46,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:08:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:08:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1624035100, now seen corresponding path program 3 times [2022-04-28 09:08:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300638967] [2022-04-28 09:08:46,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:08:46,421 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:08:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1624035100, now seen corresponding path program 4 times [2022-04-28 09:08:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:08:46,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752048218] [2022-04-28 09:08:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:08:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:08:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:08:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:46,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {9519#(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); {9498#true} is VALID [2022-04-28 09:08:46,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:46,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9498#true} {9498#true} #87#return; {9498#true} is VALID [2022-04-28 09:08:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:08:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:46,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#true} ~cond := #in~cond; {9498#true} is VALID [2022-04-28 09:08:46,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {9498#true} assume !(0 == ~cond); {9498#true} is VALID [2022-04-28 09:08:46,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:46,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9498#true} {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #85#return; {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:46,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {9498#true} call ULTIMATE.init(); {9519#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:08:46,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#(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); {9498#true} is VALID [2022-04-28 09:08:46,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:46,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9498#true} {9498#true} #87#return; {9498#true} is VALID [2022-04-28 09:08:46,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {9498#true} call #t~ret15 := main(); {9498#true} is VALID [2022-04-28 09:08:46,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {9498#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {9503#(= main_~j~0 0)} is VALID [2022-04-28 09:08:46,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(= 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; {9503#(= main_~j~0 0)} is VALID [2022-04-28 09:08:46,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {9504#(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; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9505#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:46,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {9505#(and (<= 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; {9505#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:46,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {9505#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9498#true} is VALID [2022-04-28 09:08:46,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {9498#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9498#true} is VALID [2022-04-28 09:08:46,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {9498#true} ~j~0 := 1; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {9504#(and (<= 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; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {9504#(and (<= 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; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:46,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9505#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:46,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {9505#(and (<= 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; {9506#(= 4 (* main_~i~0 4))} is VALID [2022-04-28 09:08:46,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {9506#(= 4 (* main_~i~0 4))} #t~short10 := ~i~0 >= 0; {9506#(= 4 (* main_~i~0 4))} is VALID [2022-04-28 09:08:46,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {9506#(= 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; {9507#(or (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= 4 (* main_~i~0 4))) |main_#t~short10|)} is VALID [2022-04-28 09:08:46,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {9507#(or (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= 4 (* main_~i~0 4))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9508#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:08:46,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {9508#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:08:46,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:08:46,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:08:46,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:46,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} 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); {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:46,648 INFO L272 TraceCheckUtils]: 29: Hoare triple {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9498#true} is VALID [2022-04-28 09:08:46,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {9498#true} ~cond := #in~cond; {9498#true} is VALID [2022-04-28 09:08:46,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {9498#true} assume !(0 == ~cond); {9498#true} is VALID [2022-04-28 09:08:46,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:46,649 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9498#true} {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #85#return; {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:46,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} havoc #t~mem13;havoc #t~mem14; {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:46,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {9510#(and (= main_~k~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {9515#(<= (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 09:08:46,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {9515#(<= (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); {9516#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:08:46,651 INFO L272 TraceCheckUtils]: 37: Hoare triple {9516#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9517#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:08:46,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {9517#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9518#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:08:46,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {9518#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9499#false} is VALID [2022-04-28 09:08:46,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {9499#false} assume !false; {9499#false} is VALID [2022-04-28 09:08:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:08:46,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:08:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752048218] [2022-04-28 09:08:46,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752048218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:08:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933105587] [2022-04-28 09:08:46,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:08:46,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:46,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:08:46,655 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:08:46,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 09:08:46,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:08:46,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:08:46,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:08:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:46,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:08:46,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-28 09:08:46,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:08:46,989 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 23 treesize of output 22 [2022-04-28 09:08:47,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:08:47,183 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 09:08:47,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {9498#true} call ULTIMATE.init(); {9498#true} is VALID [2022-04-28 09:08:47,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {9498#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); {9498#true} is VALID [2022-04-28 09:08:47,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:47,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9498#true} {9498#true} #87#return; {9498#true} is VALID [2022-04-28 09:08:47,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {9498#true} call #t~ret15 := main(); {9498#true} is VALID [2022-04-28 09:08:47,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {9498#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {9538#(= |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; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {9538#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {9538#(= |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; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {9538#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {9538#(= |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; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {9538#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {9538#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9538#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:08:47,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {9538#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {9563#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} is VALID [2022-04-28 09:08:47,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {9563#(and (= |main_~#v~0.offset| 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; {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:08:47,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:08:47,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~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; {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:08:47,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:08:47,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {9567#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9563#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} is VALID [2022-04-28 09:08:47,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {9563#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9583#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-28 09:08:47,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {9583#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) 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; {9587#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} is VALID [2022-04-28 09:08:47,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {9587#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {9587#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1))} is VALID [2022-04-28 09:08:47,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {9587#(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; {9594#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1) (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 09:08:47,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {9594#(and (= |main_~#v~0.offset| 0) (= main_~i~0 1) (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; {9598#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= main_~i~0 1))} is VALID [2022-04-28 09:08:47,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {9598#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (= main_~i~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9602#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:47,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {9602#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9602#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:47,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {9602#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9602#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:47,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} ~k~0 := 1; {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-28 09:08:47,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 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); {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-28 09:08:47,250 INFO L272 TraceCheckUtils]: 29: Hoare triple {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-28 09:08:47,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} ~cond := #in~cond; {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-28 09:08:47,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} assume !(0 == ~cond); {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-28 09:08:47,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} assume true; {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} is VALID [2022-04-28 09:08:47,251 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9619#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 8)))} {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} #85#return; {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-28 09:08:47,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} havoc #t~mem13;havoc #t~mem14; {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} is VALID [2022-04-28 09:08:47,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {9612#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 1))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {9638#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} is VALID [2022-04-28 09:08:47,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {9638#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))))} 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); {9516#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:08:47,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {9516#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:08:47,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {9645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:08:47,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {9649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9499#false} is VALID [2022-04-28 09:08:47,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {9499#false} assume !false; {9499#false} is VALID [2022-04-28 09:08:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:47,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:08:51,922 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 67 treesize of output 61 [2022-04-28 09:08:51,969 INFO L356 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2022-04-28 09:08:51,970 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 1699 treesize of output 1580 [2022-04-28 09:08:52,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {9499#false} assume !false; {9499#false} is VALID [2022-04-28 09:08:52,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {9649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9499#false} is VALID [2022-04-28 09:08:52,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {9645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:08:52,607 INFO L272 TraceCheckUtils]: 37: Hoare triple {9516#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:08:52,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {9515#(<= (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); {9516#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:08:52,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {9515#(<= (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 09:08:52,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} havoc #t~mem13;havoc #t~mem14; {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:08:52,609 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9498#true} {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #85#return; {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:08:52,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:52,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {9498#true} assume !(0 == ~cond); {9498#true} is VALID [2022-04-28 09:08:52,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {9498#true} ~cond := #in~cond; {9498#true} is VALID [2022-04-28 09:08:52,609 INFO L272 TraceCheckUtils]: 29: Hoare triple {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9498#true} is VALID [2022-04-28 09:08:52,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 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); {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:08:52,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {9671#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:08:52,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:08:52,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:08:52,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {9705#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9509#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:08:52,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {9709#(or (forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9705#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298))))} is VALID [2022-04-28 09:08:52,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {9713#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 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; {9709#(or (forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_298)))) |main_#t~short10|)} is VALID [2022-04-28 09:08:52,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {9713#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} #t~short10 := ~i~0 >= 0; {9713#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-28 09:08:52,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {9720#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} 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; {9713#(forall ((v_ArrVal_298 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-28 09:08:52,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {9724#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9720#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-28 09:08:52,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9724#(forall ((v_ArrVal_298 Int)) (or (< v_ArrVal_298 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_298) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-28 09:08:52,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:52,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {9504#(and (<= 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; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:52,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:52,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {9504#(and (<= 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; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:52,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {9498#true} ~j~0 := 1; {9504#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:52,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {9498#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9498#true} is VALID [2022-04-28 09:08:52,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {9498#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9498#true} is VALID [2022-04-28 09:08:52,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {9498#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; {9498#true} is VALID [2022-04-28 09:08:52,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {9498#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9498#true} is VALID [2022-04-28 09:08:52,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {9498#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; {9498#true} is VALID [2022-04-28 09:08:52,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {9498#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9498#true} is VALID [2022-04-28 09:08:52,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {9498#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; {9498#true} is VALID [2022-04-28 09:08:52,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {9498#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {9498#true} is VALID [2022-04-28 09:08:52,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {9498#true} call #t~ret15 := main(); {9498#true} is VALID [2022-04-28 09:08:52,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9498#true} {9498#true} #87#return; {9498#true} is VALID [2022-04-28 09:08:52,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {9498#true} assume true; {9498#true} is VALID [2022-04-28 09:08:52,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {9498#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); {9498#true} is VALID [2022-04-28 09:08:52,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {9498#true} call ULTIMATE.init(); {9498#true} is VALID [2022-04-28 09:08:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:08:52,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933105587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:08:52,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:08:52,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 34 [2022-04-28 09:08:52,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:08:52,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300638967] [2022-04-28 09:08:52,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300638967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:08:52,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:08:52,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:08:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898343582] [2022-04-28 09:08:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:08:52,644 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 41 [2022-04-28 09:08:52,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:08:52,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 09:08:52,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:52,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:08:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:08:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=999, Unknown=1, NotChecked=0, Total=1122 [2022-04-28 09:08:52,666 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 09:08:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:54,242 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2022-04-28 09:08:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 09:08:54,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 41 [2022-04-28 09:08:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:08:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 09:08:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-28 09:08:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 09:08:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-28 09:08:54,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-28 09:08:54,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:54,317 INFO L225 Difference]: With dead ends: 99 [2022-04-28 09:08:54,318 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 09:08:54,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=270, Invalid=2179, Unknown=1, NotChecked=0, Total=2450 [2022-04-28 09:08:54,321 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 117 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:08:54,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:08:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 09:08:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2022-04-28 09:08:54,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:08:54,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:08:54,539 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:08:54,540 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:08:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:54,543 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-28 09:08:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-04-28 09:08:54,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:54,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:54,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 97 states. [2022-04-28 09:08:54,544 INFO L87 Difference]: Start difference. First operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 97 states. [2022-04-28 09:08:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:54,554 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-28 09:08:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-04-28 09:08:54,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:54,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:54,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:08:54,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:08:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:08:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-04-28 09:08:54,568 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 41 [2022-04-28 09:08:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:08:54,568 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-04-28 09:08:54,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 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 09:08:54,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 98 transitions. [2022-04-28 09:08:54,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-28 09:08:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 09:08:54,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:08:54,796 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:08:54,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 09:08:54,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 09:08:54,997 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:08:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:08:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1436661232, now seen corresponding path program 5 times [2022-04-28 09:08:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382891007] [2022-04-28 09:08:55,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:08:55,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:08:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1436661232, now seen corresponding path program 6 times [2022-04-28 09:08:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:08:55,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304124982] [2022-04-28 09:08:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:08:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:08:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:08:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:55,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {10387#(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); {10374#true} is VALID [2022-04-28 09:08:55,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {10374#true} assume true; {10374#true} is VALID [2022-04-28 09:08:55,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10374#true} {10374#true} #87#return; {10374#true} is VALID [2022-04-28 09:08:55,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {10374#true} call ULTIMATE.init(); {10387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:08:55,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {10387#(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); {10374#true} is VALID [2022-04-28 09:08:55,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {10374#true} assume true; {10374#true} is VALID [2022-04-28 09:08:55,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10374#true} {10374#true} #87#return; {10374#true} is VALID [2022-04-28 09:08:55,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {10374#true} call #t~ret15 := main(); {10374#true} is VALID [2022-04-28 09:08:55,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {10374#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {10379#(= main_~j~0 0)} is VALID [2022-04-28 09:08:55,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {10379#(= 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; {10379#(= main_~j~0 0)} is VALID [2022-04-28 09:08:55,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {10379#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10380#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:55,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {10380#(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; {10380#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:55,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {10380#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10381#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:55,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {10381#(and (<= 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; {10381#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:55,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {10381#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10382#(and (<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) main_~j~0 (- 3)) 4294967296)) (<= main_~j~0 3))} is VALID [2022-04-28 09:08:55,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {10382#(and (<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) main_~j~0 (- 3)) 4294967296)) (<= main_~j~0 3))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10383#(<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:08:55,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {10383#(<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:55,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~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; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:55,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} #t~short10 := ~i~0 >= 0; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:55,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~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; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:55,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:55,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:55,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 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; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 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; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10386#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {10386#(<= (+ 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; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {10375#false} #t~short10 := ~i~0 >= 0; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {10375#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; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#false} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {10375#false} #t~short10 := ~i~0 >= 0; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {10375#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; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {10375#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {10375#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {10375#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {10375#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {10375#false} ~k~0 := 1; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {10375#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); {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L272 TraceCheckUtils]: 38: Hoare triple {10375#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {10375#false} ~cond := #in~cond; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {10375#false} assume 0 == ~cond; {10375#false} is VALID [2022-04-28 09:08:55,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {10375#false} assume !false; {10375#false} is VALID [2022-04-28 09:08:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:08:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:08:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304124982] [2022-04-28 09:08:55,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304124982] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:08:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968023188] [2022-04-28 09:08:55,258 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:08:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:08:55,259 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:08:55,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 09:08:55,424 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:08:55,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:08:55,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:08:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:55,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:08:57,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {10374#true} call ULTIMATE.init(); {10374#true} is VALID [2022-04-28 09:08:57,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {10374#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); {10374#true} is VALID [2022-04-28 09:08:57,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {10374#true} assume true; {10374#true} is VALID [2022-04-28 09:08:57,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10374#true} {10374#true} #87#return; {10374#true} is VALID [2022-04-28 09:08:57,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {10374#true} call #t~ret15 := main(); {10374#true} is VALID [2022-04-28 09:08:57,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {10374#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {10379#(= main_~j~0 0)} is VALID [2022-04-28 09:08:57,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {10379#(= 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; {10379#(= main_~j~0 0)} is VALID [2022-04-28 09:08:57,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {10379#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10380#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:57,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {10380#(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; {10380#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:08:57,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {10380#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10381#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:57,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {10381#(and (<= 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; {10381#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:08:57,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {10381#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10424#(and (<= 3 main_~j~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:08:57,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {10424#(and (<= 3 main_~j~0) (<= main_~j~0 3))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10383#(<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:08:57,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {10383#(<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:57,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~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; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:57,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} #t~short10 := ~i~0 >= 0; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:57,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~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; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:57,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:57,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:08:57,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {10384#(and (= (+ (- 1) main_~j~0) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) (* 4294967296 (div main_~j~0 4294967296))) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} #t~short10 := ~i~0 >= 0; {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {10449#(and (= (+ (- 2) main_~j~0) 0) (<= 0 (div (+ (* (div (+ (- 1) main_~j~0) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10468#(and (= (+ main_~j~0 (- 3)) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (div (+ (- 2) main_~j~0) 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)))} is VALID [2022-04-28 09:08:57,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {10468#(and (= (+ main_~j~0 (- 3)) 0) (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (div (+ (- 2) main_~j~0) 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 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; {10375#false} is VALID [2022-04-28 09:08:57,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {10375#false} #t~short10 := ~i~0 >= 0; {10375#false} is VALID [2022-04-28 09:08:57,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {10375#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; {10375#false} is VALID [2022-04-28 09:08:57,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#false} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {10375#false} is VALID [2022-04-28 09:08:57,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {10375#false} #t~short10 := ~i~0 >= 0; {10375#false} is VALID [2022-04-28 09:08:57,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {10375#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; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {10375#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {10375#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {10375#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {10375#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {10375#false} ~k~0 := 1; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {10375#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); {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L272 TraceCheckUtils]: 38: Hoare triple {10375#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {10375#false} ~cond := #in~cond; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {10375#false} assume 0 == ~cond; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {10375#false} assume !false; {10375#false} is VALID [2022-04-28 09:08:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:08:57,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {10375#false} assume !false; {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {10375#false} assume 0 == ~cond; {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {10375#false} ~cond := #in~cond; {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L272 TraceCheckUtils]: 38: Hoare triple {10375#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {10375#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); {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {10375#false} ~k~0 := 1; {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {10375#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {10375#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10375#false} is VALID [2022-04-28 09:09:11,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {10375#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10375#false} is VALID [2022-04-28 09:09:11,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {10375#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10375#false} is VALID [2022-04-28 09:09:11,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {10375#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; {10375#false} is VALID [2022-04-28 09:09:11,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {10375#false} #t~short10 := ~i~0 >= 0; {10375#false} is VALID [2022-04-28 09:09:11,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#false} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {10375#false} is VALID [2022-04-28 09:09:11,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {10375#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; {10375#false} is VALID [2022-04-28 09:09:11,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {10375#false} #t~short10 := ~i~0 >= 0; {10375#false} is VALID [2022-04-28 09:09:11,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {10386#(<= (+ 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; {10375#false} is VALID [2022-04-28 09:09:11,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10386#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 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; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 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; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10385#(<= main_~j~0 (+ 4294967294 (* (div (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296) 4294967296)))} is VALID [2022-04-28 09:09:11,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 09:09:11,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 09:09:11,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 09:09:11,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} #t~short10 := ~i~0 >= 0; {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 09:09:11,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} 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; {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 09:09:11,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {10383#(<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {10583#(<= main_~j~0 (+ (* (div (+ main_~j~0 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 09:09:11,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {10605#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod main_~j~0 4294967296))) 4294967296) 1) 2))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {10383#(<= 0 (div (+ (* (div (+ 4294967297 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296) 4294967296) 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:09:11,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {10609#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10605#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod main_~j~0 4294967296))) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {10609#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} 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; {10609#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {10616#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296) 1) 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10609#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {10616#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296) 1) 2))} 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; {10616#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {10623#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {10616#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {10623#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} 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; {10623#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {10374#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {10623#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:09:11,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {10374#true} call #t~ret15 := main(); {10374#true} is VALID [2022-04-28 09:09:11,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10374#true} {10374#true} #87#return; {10374#true} is VALID [2022-04-28 09:09:11,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {10374#true} assume true; {10374#true} is VALID [2022-04-28 09:09:11,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {10374#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); {10374#true} is VALID [2022-04-28 09:09:11,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {10374#true} call ULTIMATE.init(); {10374#true} is VALID [2022-04-28 09:09:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:09:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968023188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:09:11,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:09:11,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 09:09:11,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:09:11,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382891007] [2022-04-28 09:09:11,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382891007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:09:11,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:09:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:09:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769526928] [2022-04-28 09:09:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:09:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 09:09:11,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:09:11,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:09:12,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:09:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:09:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:09:12,011 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:09:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:14,282 INFO L93 Difference]: Finished difference Result 178 states and 217 transitions. [2022-04-28 09:09:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:09:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 09:09:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:09:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:09:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-04-28 09:09:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:09:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-04-28 09:09:14,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 115 transitions. [2022-04-28 09:09:14,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:14,463 INFO L225 Difference]: With dead ends: 178 [2022-04-28 09:09:14,463 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 09:09:14,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:09:14,463 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 159 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:09:14,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 76 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:09:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 09:09:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2022-04-28 09:09:15,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:09:15,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:15,079 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:15,079 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:15,082 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2022-04-28 09:09:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2022-04-28 09:09:15,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:15,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:15,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 146 states. [2022-04-28 09:09:15,083 INFO L87 Difference]: Start difference. First operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 146 states. [2022-04-28 09:09:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:15,085 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2022-04-28 09:09:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2022-04-28 09:09:15,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:15,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:15,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:09:15,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:09:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-28 09:09:15,087 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 42 [2022-04-28 09:09:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:09:15,087 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-28 09:09:15,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:09:15,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-28 09:09:15,424 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 09:09:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-28 09:09:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 09:09:15,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:09:15,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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 09:09:15,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 09:09:15,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 09:09:15,625 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:09:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:09:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807843, now seen corresponding path program 1 times [2022-04-28 09:09:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:15,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [766283626] [2022-04-28 09:09:15,631 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:09:15,631 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:09:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807843, now seen corresponding path program 2 times [2022-04-28 09:09:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:09:15,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718732484] [2022-04-28 09:09:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:09:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:09:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:09:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:16,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {11561#(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); {11537#true} is VALID [2022-04-28 09:09:16,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:16,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11537#true} {11537#true} #87#return; {11537#true} is VALID [2022-04-28 09:09:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:09:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:16,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {11537#true} ~cond := #in~cond; {11537#true} is VALID [2022-04-28 09:09:16,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {11537#true} assume !(0 == ~cond); {11537#true} is VALID [2022-04-28 09:09:16,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:16,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11537#true} {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #85#return; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:16,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {11537#true} call ULTIMATE.init(); {11561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:09:16,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11561#(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); {11537#true} is VALID [2022-04-28 09:09:16,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:16,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11537#true} {11537#true} #87#return; {11537#true} is VALID [2022-04-28 09:09:16,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {11537#true} call #t~ret15 := main(); {11537#true} is VALID [2022-04-28 09:09:16,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {11537#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {11542#(= main_~j~0 0)} is VALID [2022-04-28 09:09:16,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {11542#(= 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; {11542#(= main_~j~0 0)} is VALID [2022-04-28 09:09:16,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {11542#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {11543#(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; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11544#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:09:16,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {11544#(and (<= 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; {11544#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:09:16,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {11544#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:16,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {11537#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11537#true} is VALID [2022-04-28 09:09:16,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {11537#true} ~j~0 := 1; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {11543#(and (<= 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; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {11543#(and (<= 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; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:16,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11545#(or (= (* main_~j~0 4) 8) (< main_~j~0 2))} is VALID [2022-04-28 09:09:16,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {11545#(or (= (* main_~j~0 4) 8) (< 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; {11546#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:09:16,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {11546#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {11546#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:09:16,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {11546#(or (< main_~i~0 1) (= 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; {11547#(or (< main_~i~0 1) (and (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))))) (= 4 (* main_~i~0 4))))} is VALID [2022-04-28 09:09:16,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {11547#(or (< main_~i~0 1) (and (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))))) (= 4 (* main_~i~0 4))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {11548#(or (<= (+ main_~i~0 1) 0) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:09:16,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {11548#(or (<= (+ main_~i~0 1) 0) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {11549#(or (not |main_#t~short10|) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:09:16,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {11549#(or (not |main_#t~short10|) (and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 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; {11550#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:09:16,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {11550#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11550#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:09:16,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {11550#(and (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= 0 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:16,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:16,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:16,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:16,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} 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); {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:16,111 INFO L272 TraceCheckUtils]: 32: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11537#true} is VALID [2022-04-28 09:09:16,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {11537#true} ~cond := #in~cond; {11537#true} is VALID [2022-04-28 09:09:16,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {11537#true} assume !(0 == ~cond); {11537#true} is VALID [2022-04-28 09:09:16,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:16,112 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11537#true} {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #85#return; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:16,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:16,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {11557#(<= (+ (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 09:09:16,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {11557#(<= (+ (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); {11558#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:09:16,113 INFO L272 TraceCheckUtils]: 40: Hoare triple {11558#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:09:16,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {11559#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11560#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:09:16,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {11560#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11538#false} is VALID [2022-04-28 09:09:16,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {11538#false} assume !false; {11538#false} is VALID [2022-04-28 09:09:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:09:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:09:16,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718732484] [2022-04-28 09:09:16,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718732484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:09:16,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559781076] [2022-04-28 09:09:16,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:09:16,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:09:16,132 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:09:16,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 09:09:16,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:09:16,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:09:16,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:09:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:16,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:09:16,551 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-28 09:09:16,551 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 09:09:17,194 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-04-28 09:09:17,194 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 09:09:27,624 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 09:09:27,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-04-28 09:09:27,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {11537#true} call ULTIMATE.init(); {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {11537#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); {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11537#true} {11537#true} #87#return; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {11537#true} call #t~ret15 := main(); {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {11537#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {11537#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; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {11537#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {11537#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; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {11537#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {11537#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; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {11537#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {11537#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11537#true} is VALID [2022-04-28 09:09:27,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {11537#true} ~j~0 := 1; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:27,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {11543#(and (<= 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; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:27,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:27,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {11543#(and (<= 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; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:27,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:27,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:27,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {11543#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11544#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:09:27,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {11544#(and (<= 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; {11625#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:09:27,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {11625#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~short10 := ~i~0 >= 0; {11625#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:09:27,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {11625#(and (<= 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; {11632#(and (<= main_~i~0 1) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 1 main_~i~0))} is VALID [2022-04-28 09:09:27,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {11632#(and (<= main_~i~0 1) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 1 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {11636#(exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47)))} is VALID [2022-04-28 09:09:27,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {11636#(exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47)))} #t~short10 := ~i~0 >= 0; {11640#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 09:09:27,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {11640#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47) (<= 1 v_main_~i~0_47))) (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; {11644#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} is VALID [2022-04-28 09:09:27,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {11644#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11644#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} is VALID [2022-04-28 09:09:27,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {11644#(and (exists ((v_main_~i~0_47 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|))) (<= v_main_~i~0_47 1) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_47 4) |main_~#v~0.offset| 4))) (<= (+ main_~i~0 1) v_main_~i~0_47))) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:27,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:27,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:27,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {11551#(<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:27,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} 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); {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:27,726 INFO L272 TraceCheckUtils]: 32: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-28 09:09:27,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} ~cond := #in~cond; {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-28 09:09:27,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} assume !(0 == ~cond); {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-28 09:09:27,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} assume true; {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} is VALID [2022-04-28 09:09:27,728 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11666#(exists ((|v_main_~#v~0.base_BEFORE_CALL_3| Int) (|v_main_~#v~0.offset_BEFORE_CALL_3| Int)) (<= (+ (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ |v_main_~#v~0.offset_BEFORE_CALL_3| 4)) 1) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_3|) (+ 8 |v_main_~#v~0.offset_BEFORE_CALL_3|))))} {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #85#return; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:27,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:09:27,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {11552#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {11685#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 2))} is VALID [2022-04-28 09:09:27,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {11685#(and (<= (+ 1 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8))) (= main_~k~0 2))} 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); {11558#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:09:27,729 INFO L272 TraceCheckUtils]: 40: Hoare triple {11558#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:09:27,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {11692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:09:27,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {11696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11538#false} is VALID [2022-04-28 09:09:27,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {11538#false} assume !false; {11538#false} is VALID [2022-04-28 09:09:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:09:27,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:09:36,863 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 71 treesize of output 63 [2022-04-28 09:09:36,942 INFO L356 Elim1Store]: treesize reduction 31, result has 24.4 percent of original size [2022-04-28 09:09:36,943 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 883 treesize of output 817 [2022-04-28 09:09:38,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {11538#false} assume !false; {11538#false} is VALID [2022-04-28 09:09:38,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {11696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11538#false} is VALID [2022-04-28 09:09:38,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {11692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:09:38,085 INFO L272 TraceCheckUtils]: 40: Hoare triple {11712#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:09:38,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {11716#(<= (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); {11712#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:09:38,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {11716#(<= (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 09:09:38,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} havoc #t~mem13;havoc #t~mem14; {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:09:38,088 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11537#true} {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} #85#return; {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:09:38,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:38,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {11537#true} assume !(0 == ~cond); {11537#true} is VALID [2022-04-28 09:09:38,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {11537#true} ~cond := #in~cond; {11537#true} is VALID [2022-04-28 09:09:38,088 INFO L272 TraceCheckUtils]: 32: Hoare triple {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11537#true} is VALID [2022-04-28 09:09:38,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 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); {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:09:38,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {11745#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} ~k~0 := 1; {11720#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) 4)))} is VALID [2022-04-28 09:09:38,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {11745#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11745#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:38,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {11745#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11745#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:38,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {11755#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11745#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 8)))} is VALID [2022-04-28 09:09:38,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {11755#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11755#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-28 09:09:38,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {11762#(or (not |main_#t~short10|) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11755#(forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-28 09:09:38,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {11766#(or (not (<= 0 main_~i~0)) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} #t~short10 := ~i~0 >= 0; {11762#(or (not |main_#t~short10|) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} is VALID [2022-04-28 09:09:38,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {11770#(or (not |main_#t~short10|) (forall ((v_main_~i~0_48 Int) (v_ArrVal_361 Int) (v_ArrVal_359 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (not (<= 0 v_main_~i~0_48)) (not (<= (+ v_main_~i~0_48 1) main_~i~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_359)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {11766#(or (not (<= 0 main_~i~0)) (forall ((v_ArrVal_361 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} is VALID [2022-04-28 09:09:38,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {11546#(or (< main_~i~0 1) (= 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; {11770#(or (not |main_#t~short10|) (forall ((v_main_~i~0_48 Int) (v_ArrVal_361 Int) (v_ArrVal_359 Int)) (or (not (<= v_ArrVal_361 main_~key~0)) (not (<= 0 v_main_~i~0_48)) (not (<= (+ v_main_~i~0_48 1) main_~i~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_359)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 4)) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_359) (+ |main_~#v~0.offset| (* v_main_~i~0_48 4) 4) v_ArrVal_361) (+ |main_~#v~0.offset| 8))))))} is VALID [2022-04-28 09:09:38,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {11546#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {11546#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:09:38,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {11545#(or (= (* main_~j~0 4) 8) (< 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; {11546#(or (< main_~i~0 1) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:09:38,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11545#(or (= (* main_~j~0 4) 8) (< main_~j~0 2))} is VALID [2022-04-28 09:09:38,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-28 09:09:38,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-28 09:09:38,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 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; {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-28 09:09:38,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} #t~short10 := ~i~0 >= 0; {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {11783#(or (< main_~j~0 1) (= 8 (+ (* 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; {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {11537#true} ~j~0 := 1; {11783#(or (< main_~j~0 1) (= 8 (+ (* main_~j~0 4) 4)))} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {11537#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11537#true} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {11537#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {11537#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; {11537#true} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {11537#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {11537#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; {11537#true} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {11537#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11537#true} is VALID [2022-04-28 09:09:38,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {11537#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; {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {11537#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {11537#true} call #t~ret15 := main(); {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11537#true} {11537#true} #87#return; {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {11537#true} assume true; {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11537#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); {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {11537#true} call ULTIMATE.init(); {11537#true} is VALID [2022-04-28 09:09:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:09:38,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559781076] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:09:38,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:09:38,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 36 [2022-04-28 09:09:38,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:09:38,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [766283626] [2022-04-28 09:09:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [766283626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:09:38,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:09:38,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:09:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997123382] [2022-04-28 09:09:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:09:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 44 [2022-04-28 09:09:38,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:09:38,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 09:09:38,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:09:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:09:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1112, Unknown=6, NotChecked=0, Total=1260 [2022-04-28 09:09:38,136 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 09:09:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:41,786 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2022-04-28 09:09:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 09:09:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 44 [2022-04-28 09:09:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:09:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 09:09:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 115 transitions. [2022-04-28 09:09:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 09:09:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 115 transitions. [2022-04-28 09:09:41,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 115 transitions. [2022-04-28 09:09:41,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:41,897 INFO L225 Difference]: With dead ends: 159 [2022-04-28 09:09:41,897 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 09:09:41,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=481, Invalid=3295, Unknown=6, NotChecked=0, Total=3782 [2022-04-28 09:09:41,898 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:09:41,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 79 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 09:09:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 09:09:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2022-04-28 09:09:42,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:09:42,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:42,511 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:42,511 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:42,514 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2022-04-28 09:09:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2022-04-28 09:09:42,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:42,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:42,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 157 states. [2022-04-28 09:09:42,515 INFO L87 Difference]: Start difference. First operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 157 states. [2022-04-28 09:09:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:42,517 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2022-04-28 09:09:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2022-04-28 09:09:42,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:42,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:42,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:09:42,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:09:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 106 states have internal predecessors, (126), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2022-04-28 09:09:42,522 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 44 [2022-04-28 09:09:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:09:42,522 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2022-04-28 09:09:42,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 09:09:42,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 137 transitions. [2022-04-28 09:09:43,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2022-04-28 09:09:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 09:09:43,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:09:43,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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 09:09:43,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 09:09:43,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:43,211 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:09:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:09:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 521215711, now seen corresponding path program 1 times [2022-04-28 09:09:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961729421] [2022-04-28 09:09:43,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:09:43,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:09:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash 521215711, now seen corresponding path program 2 times [2022-04-28 09:09:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:09:43,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037275514] [2022-04-28 09:09:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:09:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:09:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:09:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:43,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {12771#(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); {12757#true} is VALID [2022-04-28 09:09:43,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12757#true} {12757#true} #87#return; {12757#true} is VALID [2022-04-28 09:09:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:09:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:43,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {12757#true} ~cond := #in~cond; {12757#true} is VALID [2022-04-28 09:09:43,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {12757#true} assume !(0 == ~cond); {12757#true} is VALID [2022-04-28 09:09:43,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12757#true} {12758#false} #85#return; {12758#false} is VALID [2022-04-28 09:09:43,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {12757#true} call ULTIMATE.init(); {12771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {12771#(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); {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12757#true} {12757#true} #87#return; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {12757#true} call #t~ret15 := main(); {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {12757#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {12757#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12757#true} is VALID [2022-04-28 09:09:43,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {12757#true} ~j~0 := 1; {12762#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:09:43,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {12762#(= (+ (- 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; {12762#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:09:43,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {12762#(= (+ (- 1) main_~j~0) 0)} #t~short10 := ~i~0 >= 0; {12762#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:09:43,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {12762#(= (+ (- 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; {12762#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:09:43,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {12762#(= (+ (- 1) main_~j~0) 0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12762#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:09:43,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {12762#(= (+ (- 1) main_~j~0) 0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12762#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:09:43,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {12762#(= (+ (- 1) main_~j~0) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12763#(<= 2 main_~j~0)} is VALID [2022-04-28 09:09:43,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(<= 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; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {12764#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {12764#(<= 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; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {12764#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {12765#(<= 0 main_~i~0)} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {12765#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {12766#|main_#t~short10|} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {12766#|main_#t~short10|} assume !#t~short10; {12758#false} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {12758#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12758#false} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {12758#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12758#false} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {12758#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12758#false} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {12758#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12758#false} is VALID [2022-04-28 09:09:43,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {12758#false} ~k~0 := 1; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {12758#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); {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L272 TraceCheckUtils]: 32: Hoare triple {12758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12757#true} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {12757#true} ~cond := #in~cond; {12757#true} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {12757#true} assume !(0 == ~cond); {12757#true} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,302 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12757#true} {12758#false} #85#return; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {12758#false} havoc #t~mem13;havoc #t~mem14; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {12758#false} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {12758#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); {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L272 TraceCheckUtils]: 40: Hoare triple {12758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {12758#false} ~cond := #in~cond; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {12758#false} assume 0 == ~cond; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {12758#false} assume !false; {12758#false} is VALID [2022-04-28 09:09:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 09:09:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:09:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037275514] [2022-04-28 09:09:43,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037275514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:09:43,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976151005] [2022-04-28 09:09:43,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:09:43,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:43,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:09:43,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:09:43,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 09:09:43,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:09:43,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:09:43,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:09:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:43,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:09:43,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {12757#true} call ULTIMATE.init(); {12757#true} is VALID [2022-04-28 09:09:43,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {12757#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); {12757#true} is VALID [2022-04-28 09:09:43,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12757#true} {12757#true} #87#return; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {12757#true} call #t~ret15 := main(); {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {12757#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {12757#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12757#true} is VALID [2022-04-28 09:09:43,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {12757#true} ~j~0 := 1; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {12814#(<= 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; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {12814#(<= 1 main_~j~0)} #t~short10 := ~i~0 >= 0; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {12814#(<= 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; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {12814#(<= 1 main_~j~0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {12814#(<= 1 main_~j~0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {12814#(<= 1 main_~j~0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12763#(<= 2 main_~j~0)} is VALID [2022-04-28 09:09:43,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(<= 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; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {12764#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {12764#(<= 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; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {12764#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {12765#(<= 0 main_~i~0)} is VALID [2022-04-28 09:09:43,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {12765#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {12766#|main_#t~short10|} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {12766#|main_#t~short10|} assume !#t~short10; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {12758#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {12758#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {12758#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {12758#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {12758#false} ~k~0 := 1; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {12758#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); {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L272 TraceCheckUtils]: 32: Hoare triple {12758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {12758#false} ~cond := #in~cond; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {12758#false} assume !(0 == ~cond); {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {12758#false} assume true; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12758#false} {12758#false} #85#return; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {12758#false} havoc #t~mem13;havoc #t~mem14; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {12758#false} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {12758#false} is VALID [2022-04-28 09:09:43,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {12758#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); {12758#false} is VALID [2022-04-28 09:09:43,507 INFO L272 TraceCheckUtils]: 40: Hoare triple {12758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12758#false} is VALID [2022-04-28 09:09:43,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {12758#false} ~cond := #in~cond; {12758#false} is VALID [2022-04-28 09:09:43,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {12758#false} assume 0 == ~cond; {12758#false} is VALID [2022-04-28 09:09:43,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {12758#false} assume !false; {12758#false} is VALID [2022-04-28 09:09:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 09:09:43,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:09:43,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {12758#false} assume !false; {12758#false} is VALID [2022-04-28 09:09:43,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {12758#false} assume 0 == ~cond; {12758#false} is VALID [2022-04-28 09:09:43,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {12758#false} ~cond := #in~cond; {12758#false} is VALID [2022-04-28 09:09:43,637 INFO L272 TraceCheckUtils]: 40: Hoare triple {12758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12758#false} is VALID [2022-04-28 09:09:43,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {12758#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); {12758#false} is VALID [2022-04-28 09:09:43,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {12758#false} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {12758#false} is VALID [2022-04-28 09:09:43,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {12758#false} havoc #t~mem13;havoc #t~mem14; {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12757#true} {12758#false} #85#return; {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {12757#true} assume !(0 == ~cond); {12757#true} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {12757#true} ~cond := #in~cond; {12757#true} is VALID [2022-04-28 09:09:43,638 INFO L272 TraceCheckUtils]: 32: Hoare triple {12758#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {12757#true} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {12758#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); {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {12758#false} ~k~0 := 1; {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {12758#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {12758#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {12758#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {12758#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12758#false} is VALID [2022-04-28 09:09:43,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {12766#|main_#t~short10|} assume !#t~short10; {12758#false} is VALID [2022-04-28 09:09:43,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {12765#(<= 0 main_~i~0)} #t~short10 := ~i~0 >= 0; {12766#|main_#t~short10|} is VALID [2022-04-28 09:09:43,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {12764#(<= 1 main_~i~0)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {12765#(<= 0 main_~i~0)} is VALID [2022-04-28 09:09:43,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {12764#(<= 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; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {12764#(<= 1 main_~i~0)} #t~short10 := ~i~0 >= 0; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(<= 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; {12764#(<= 1 main_~i~0)} is VALID [2022-04-28 09:09:43,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {12814#(<= 1 main_~j~0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12763#(<= 2 main_~j~0)} is VALID [2022-04-28 09:09:43,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {12814#(<= 1 main_~j~0)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {12814#(<= 1 main_~j~0)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {12814#(<= 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; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {12814#(<= 1 main_~j~0)} #t~short10 := ~i~0 >= 0; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {12814#(<= 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; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {12757#true} ~j~0 := 1; {12814#(<= 1 main_~j~0)} is VALID [2022-04-28 09:09:43,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {12757#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {12757#true} is VALID [2022-04-28 09:09:43,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {12757#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {12757#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; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {12757#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {12757#true} call #t~ret15 := main(); {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12757#true} {12757#true} #87#return; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {12757#true} assume true; {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {12757#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); {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {12757#true} call ULTIMATE.init(); {12757#true} is VALID [2022-04-28 09:09:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 09:09:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976151005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:09:43,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:09:43,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-28 09:09:43,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:09:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961729421] [2022-04-28 09:09:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961729421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:09:43,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:09:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:09:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965900595] [2022-04-28 09:09:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:09:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-28 09:09:43,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:09:43,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:09:43,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:43,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:09:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:09:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:09:43,669 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:09:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:44,680 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-04-28 09:09:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:09:44,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-04-28 09:09:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:09:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:09:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-28 09:09:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:09:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-28 09:09:44,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-28 09:09:44,753 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 09:09:44,756 INFO L225 Difference]: With dead ends: 212 [2022-04-28 09:09:44,756 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 09:09:44,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 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 09:09:44,758 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 101 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:09:44,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 46 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:09:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 09:09:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 117. [2022-04-28 09:09:45,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:09:45,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:45,351 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:45,351 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:45,353 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2022-04-28 09:09:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2022-04-28 09:09:45,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:45,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:45,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 153 states. [2022-04-28 09:09:45,353 INFO L87 Difference]: Start difference. First operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 153 states. [2022-04-28 09:09:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:45,355 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2022-04-28 09:09:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2022-04-28 09:09:45,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:45,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:45,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:09:45,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:09:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:09:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2022-04-28 09:09:45,357 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 44 [2022-04-28 09:09:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:09:45,357 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2022-04-28 09:09:45,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:09:45,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 135 transitions. [2022-04-28 09:09:45,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-04-28 09:09:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 09:09:45,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:09:45,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:09:45,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 09:09:45,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 09:09:45,956 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:09:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:09:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1979815022, now seen corresponding path program 7 times [2022-04-28 09:09:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:45,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443093471] [2022-04-28 09:09:45,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:09:45,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:09:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1979815022, now seen corresponding path program 8 times [2022-04-28 09:09:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:09:45,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649769966] [2022-04-28 09:09:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:09:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:09:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:09:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:46,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {14043#(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); {14016#true} is VALID [2022-04-28 09:09:46,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {14016#true} assume true; {14016#true} is VALID [2022-04-28 09:09:46,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14016#true} {14016#true} #87#return; {14016#true} is VALID [2022-04-28 09:09:46,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {14016#true} call ULTIMATE.init(); {14043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:09:46,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {14043#(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); {14016#true} is VALID [2022-04-28 09:09:46,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {14016#true} assume true; {14016#true} is VALID [2022-04-28 09:09:46,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14016#true} {14016#true} #87#return; {14016#true} is VALID [2022-04-28 09:09:46,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {14016#true} call #t~ret15 := main(); {14016#true} is VALID [2022-04-28 09:09:46,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {14016#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {14021#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:09:46,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {14021#(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; {14021#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:09:46,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {14021#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14022#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:46,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {14022#(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; {14022#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:46,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {14022#(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; {14023#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} is VALID [2022-04-28 09:09:46,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {14023#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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; {14023#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} is VALID [2022-04-28 09:09:46,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {14023#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14024#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-28 09:09:46,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {14024#(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; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:46,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {14025#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:46,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {14025#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:46,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {14025#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {14022#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:46,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {14022#(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; {14026#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:09:46,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {14026#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {14027#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-28 09:09:46,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {14027#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (<= 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; {14028#(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 09:09:46,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {14028#(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; {14029#(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 09:09:46,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {14029#(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); {14030#(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 09:09:46,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {14030#(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; {14031#(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 09:09:46,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {14031#(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; {14032#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= main_~i~0 1) (or (<= (+ main_~i~0 1) 0) (<= (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 09:09:46,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {14032#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= main_~i~0 1) (or (<= (+ main_~i~0 1) 0) (<= (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))))))} #t~short10 := ~i~0 >= 0; {14033#(and (= |main_~#v~0.offset| 0) (or (and (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (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)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0))) (not |main_#t~short10|)))} is VALID [2022-04-28 09:09:46,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {14033#(and (= |main_~#v~0.offset| 0) (or (and (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (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)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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; {14034#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (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)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 09:09:46,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {14034#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (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)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {14034#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (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)))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 09:09:46,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {14034#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (not (= (+ 8 (* main_~i~0 4)) (* main_~j~0 4))) (<= (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)))) (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); {14031#(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 09:09:46,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {14031#(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)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {14035#(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_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} is VALID [2022-04-28 09:09:46,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {14035#(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_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} 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; {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-28 09:09:46,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} #t~short10 := ~i~0 >= 0; {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-28 09:09:46,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 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; {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-28 09:09:46,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {14037#(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 09:09:46,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {14037#(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; {14037#(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 09:09:46,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {14037#(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; {14037#(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 09:09:46,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {14037#(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; {14037#(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 09:09:46,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {14037#(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); {14038#(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 09:09:46,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {14038#(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; {14038#(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 09:09:46,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {14038#(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); {14038#(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 09:09:46,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {14038#(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; {14039#(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 09:09:46,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {14039#(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); {14040#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:09:46,660 INFO L272 TraceCheckUtils]: 40: Hoare triple {14040#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {14041#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:09:46,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {14041#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14042#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:09:46,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {14042#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14017#false} is VALID [2022-04-28 09:09:46,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {14017#false} assume !false; {14017#false} is VALID [2022-04-28 09:09:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:09:46,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:09:46,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649769966] [2022-04-28 09:09:46,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649769966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:09:46,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140453992] [2022-04-28 09:09:46,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:09:46,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:09:46,664 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:09:46,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 09:09:46,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:09:46,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:09:46,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 09:09:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:46,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:09:47,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,109 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 09:09:47,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:09:47,324 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 33 treesize of output 35 [2022-04-28 09:09:47,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:09:47,437 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 32 treesize of output 34 [2022-04-28 09:09:47,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:09:47,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:09:47,516 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 09:09:47,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:09:47,590 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 09:09:47,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {14016#true} call ULTIMATE.init(); {14016#true} is VALID [2022-04-28 09:09:47,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {14016#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); {14016#true} is VALID [2022-04-28 09:09:47,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {14016#true} assume true; {14016#true} is VALID [2022-04-28 09:09:47,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14016#true} {14016#true} #87#return; {14016#true} is VALID [2022-04-28 09:09:47,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {14016#true} call #t~ret15 := main(); {14016#true} is VALID [2022-04-28 09:09:47,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {14016#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 * (~SIZE~0 % 4294967296));~j~0 := 0; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {14025#(= |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; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {14025#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {14025#(= |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; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {14025#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {14025#(= |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; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {14025#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {14025#(= |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; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {14025#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {14025#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {14025#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:09:47,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {14025#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {14022#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:09:47,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {14022#(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; {14026#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:09:47,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {14026#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {14098#(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 09:09:47,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {14098#(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; {14028#(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 09:09:47,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {14028#(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; {14029#(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 09:09:47,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {14029#(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); {14030#(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 09:09:47,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {14030#(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; {14031#(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 09:09:47,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {14031#(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; {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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 09:09:47,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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)))))} #t~short10 := ~i~0 >= 0; {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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 09:09:47,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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 #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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 09:09:47,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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 !#t~short10;havoc #t~mem9;havoc #t~short10; {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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 09:09:47,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {14114#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= main_~j~0 (+ main_~i~0 1)) (<= (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)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {14031#(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 09:09:47,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {14031#(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)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {14035#(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_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} is VALID [2022-04-28 09:09:47,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {14035#(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_~j~0 4) (- 8)))) (= (* main_~j~0 4) 12))} 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; {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-28 09:09:47,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} #t~short10 := ~i~0 >= 0; {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-28 09:09:47,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 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; {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} is VALID [2022-04-28 09:09:47,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {14036#(and (= |main_~#v~0.offset| 0) (= 8 (* main_~i~0 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (- 4) (* main_~i~0 4)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {14037#(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 09:09:47,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {14037#(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; {14037#(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 09:09:47,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {14037#(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; {14037#(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 09:09:47,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {14037#(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; {14037#(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 09:09:47,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {14037#(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); {14038#(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 09:09:47,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {14038#(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; {14038#(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 09:09:47,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {14038#(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); {14038#(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 09:09:47,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {14038#(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; {14039#(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 09:09:47,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {14039#(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); {14040#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:09:47,692 INFO L272 TraceCheckUtils]: 40: Hoare triple {14040#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {14169#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:09:47,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {14169#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14173#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:09:47,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {14173#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14017#false} is VALID [2022-04-28 09:09:47,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {14017#false} assume !false; {14017#false} is VALID [2022-04-28 09:09:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 09:09:47,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:10:00,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_58 Int)) (or (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_429 Int)) (let ((.cse0 (let ((.cse1 (* c_main_~j~0 4))) (store (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* v_main_~i~0_58 4) 4) v_ArrVal_429) (+ |c_main_~#v~0.offset| .cse1 4) v_ArrVal_431) (+ |c_main_~#v~0.offset| .cse1) v_ArrVal_434)))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4))))) (not (<= c_main_~j~0 (+ v_main_~i~0_58 1))))) is different from false [2022-04-28 09:10:01,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_main_~i~0_58 Int) (v_ArrVal_429 Int)) (or (not (<= c_main_~j~0 v_main_~i~0_58)) (let ((.cse0 (let ((.cse1 (* c_main_~j~0 4))) (store (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* v_main_~i~0_58 4) 4) v_ArrVal_429) (+ |c_main_~#v~0.offset| 8 .cse1) v_ArrVal_431) (+ |c_main_~#v~0.offset| .cse1 4) v_ArrVal_434)))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4)))))) is different from false [2022-04-28 09:10:03,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_main_~i~0_58 Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (or (not (<= c_main_~key~0 v_ArrVal_427)) (let ((.cse0 (let ((.cse1 (* c_main_~j~0 4))) (store (store (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* c_main_~i~0 4) |c_main_~#v~0.offset| 4) v_ArrVal_427) (+ |c_main_~#v~0.offset| (* v_main_~i~0_58 4) 4) v_ArrVal_429) (+ |c_main_~#v~0.offset| 8 .cse1) v_ArrVal_431) (+ |c_main_~#v~0.offset| .cse1 4) v_ArrVal_434)))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4)))) (not (<= c_main_~j~0 v_main_~i~0_58)))) is different from false [2022-04-28 09:10:04,710 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 89 treesize of output 83 [2022-04-28 09:10:04,907 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 09:10:04,909 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 1298737 treesize of output 1274175 [2022-04-28 09:11:13,997 WARN L232 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 986 DAG size of output: 930 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-28 09:11:30,279 WARN L232 SmtUtils]: Spent 13.55s on a formula simplification. DAG size of input: 916 DAG size of output: 916 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-28 09:11:45,597 WARN L232 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 914 DAG size of output: 914 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-28 09:12:07,321 WARN L232 SmtUtils]: Spent 15.70s on a formula simplification. DAG size of input: 912 DAG size of output: 912 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-28 09:12:25,978 WARN L232 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 901 DAG size of output: 901 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)