/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:15,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:15,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:15,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:15,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:15,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:15,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:15,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:15,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:15,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:15,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:15,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:15,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:15,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:15,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:15,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:15,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:15,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:15,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:15,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:15,482 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:15,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:15,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:15,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:15,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:15,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:15,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:15,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:15,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:15,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:15,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:15,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:15,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:15,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:15,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:15,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:15,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:15,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:15,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:15,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:15,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:15,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:15,503 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:15,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:15,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:15,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:15,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:15,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:15,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:15,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:15,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:15,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:15,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:15,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:15,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:15,516 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:15,516 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:15,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:15,516 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:15,516 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:15,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:15,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:15,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:15,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:15,803 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:15,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-1.c [2022-04-28 09:00:15,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5680e01/37ce91db2e864cf3ac5f91e36cfdd67b/FLAG2f0295c98 [2022-04-28 09:00:16,285 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:16,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c [2022-04-28 09:00:16,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5680e01/37ce91db2e864cf3ac5f91e36cfdd67b/FLAG2f0295c98 [2022-04-28 09:00:16,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5680e01/37ce91db2e864cf3ac5f91e36cfdd67b [2022-04-28 09:00:16,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:16,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:16,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:16,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:16,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:16,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:16" (1/1) ... [2022-04-28 09:00:16,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6537a120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:16, skipping insertion in model container [2022-04-28 09:00:16,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:16" (1/1) ... [2022-04-28 09:00:16,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:16,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:16,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c[328,341] [2022-04-28 09:00:16,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:16,551 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:16,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c[328,341] [2022-04-28 09:00:16,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:16,596 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:16,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:16 WrapperNode [2022-04-28 09:00:16,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:16,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:16,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:16,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:16,609 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:16" (1/1) ... [2022-04-28 09:00:16,609 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:16" (1/1) ... [2022-04-28 09:00:16,616 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:16" (1/1) ... [2022-04-28 09:00:16,616 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:16" (1/1) ... [2022-04-28 09:00:16,629 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:16" (1/1) ... [2022-04-28 09:00:16,633 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:16" (1/1) ... [2022-04-28 09:00:16,634 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:16" (1/1) ... [2022-04-28 09:00:16,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:16,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:16,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:16,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:16,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:16" (1/1) ... [2022-04-28 09:00:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:16,672 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:16,698 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:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:16,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:16,719 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:16,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:00:16,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:16,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:00:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:00:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:00:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:00:16,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:16,803 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:16,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:17,026 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:17,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:17,032 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 09:00:17,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:17 BoogieIcfgContainer [2022-04-28 09:00:17,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:17,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:17,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:17,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:17,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:16" (1/3) ... [2022-04-28 09:00:17,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88bcb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:17, skipping insertion in model container [2022-04-28 09:00:17,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:16" (2/3) ... [2022-04-28 09:00:17,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88bcb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:17, skipping insertion in model container [2022-04-28 09:00:17,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:17" (3/3) ... [2022-04-28 09:00:17,042 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2022-04-28 09:00:17,060 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:17,060 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:17,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:17,117 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@2636c64e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ea54189 [2022-04-28 09:00:17,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:00:17,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:17,130 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:17,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1898607287, now seen corresponding path program 1 times [2022-04-28 09:00:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:17,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603366288] [2022-04-28 09:00:17,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1898607287, now seen corresponding path program 2 times [2022-04-28 09:00:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:17,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499867730] [2022-04-28 09:00:17,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:17,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-28 09:00:17,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 09:00:17,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #94#return; {36#true} is VALID [2022-04-28 09:00:17,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:17,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-28 09:00:17,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 09:00:17,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #94#return; {36#true} is VALID [2022-04-28 09:00:17,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret15 := main(); {36#true} is VALID [2022-04-28 09:00:17,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));~j~0 := 0; {41#(= main_~j~0 0)} is VALID [2022-04-28 09:00:17,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:17,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:17,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:17,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {43#(and (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 09:00:17,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#(and (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (* (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); {37#false} is VALID [2022-04-28 09:00:17,425 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {37#false} is VALID [2022-04-28 09:00:17,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-28 09:00:17,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-28 09:00:17,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 09:00:17,426 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:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:17,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499867730] [2022-04-28 09:00:17,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499867730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:17,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:17,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:17,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:17,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603366288] [2022-04-28 09:00:17,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603366288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:17,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:17,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484435452] [2022-04-28 09:00:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:17,436 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:17,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:17,440 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:17,458 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:17,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:00:17,478 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:17,795 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-28 09:00:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:00:17,796 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:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:17,798 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:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-04-28 09:00:17,815 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:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-04-28 09:00:17,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 92 transitions. [2022-04-28 09:00:17,915 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:00:17,924 INFO L225 Difference]: With dead ends: 67 [2022-04-28 09:00:17,924 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:00:17,928 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:17,934 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:17,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 47 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:00:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 09:00:17,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:17,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,969 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,969 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:17,974 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 09:00:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:00:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:17,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:17,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 09:00:17,978 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 09:00:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:17,981 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 09:00:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:00:17,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:17,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:17,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:17,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-28 09:00:17,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2022-04-28 09:00:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:17,987 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-28 09:00:17,988 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:17,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-28 09:00:18,025 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:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 09:00:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:00:18,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:18,031 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:18,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:00:18,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1409532089, now seen corresponding path program 1 times [2022-04-28 09:00:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100563242] [2022-04-28 09:00:18,054 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:18,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1409532089, now seen corresponding path program 2 times [2022-04-28 09:00:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:18,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651549957] [2022-04-28 09:00:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:18,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {316#(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); {307#true} is VALID [2022-04-28 09:00:18,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:00:18,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #94#return; {307#true} is VALID [2022-04-28 09:00:18,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:18,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#(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); {307#true} is VALID [2022-04-28 09:00:18,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:00:18,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #94#return; {307#true} is VALID [2022-04-28 09:00:18,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret15 := main(); {307#true} is VALID [2022-04-28 09:00:18,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#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; {312#(= main_~j~0 0)} is VALID [2022-04-28 09:00:18,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(= 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; {312#(= main_~j~0 0)} is VALID [2022-04-28 09:00:18,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {313#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:18,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:18,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:18,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:18,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {315#(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:18,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(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); {308#false} is VALID [2022-04-28 09:00:18,317 INFO L272 TraceCheckUtils]: 13: Hoare triple {308#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {308#false} is VALID [2022-04-28 09:00:18,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-28 09:00:18,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-28 09:00:18,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 09:00:18,318 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:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651549957] [2022-04-28 09:00:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651549957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156371930] [2022-04-28 09:00:18,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:18,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:18,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:18,321 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:18,351 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:18,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:00:18,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:18,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:00:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:18,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:19,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-28 09:00:19,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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); {307#true} is VALID [2022-04-28 09:00:19,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 09:00:19,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #94#return; {307#true} is VALID [2022-04-28 09:00:19,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret15 := main(); {307#true} is VALID [2022-04-28 09:00:19,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#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; {307#true} is VALID [2022-04-28 09:00:19,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#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; {307#true} is VALID [2022-04-28 09:00:19,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {307#true} is VALID [2022-04-28 09:00:19,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {307#true} is VALID [2022-04-28 09:00:19,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} ~j~0 := 1; {313#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:19,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#(and (<= 0 (div (+ (- 1) main_~j~0) 4294967296)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:19,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {315#(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:19,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(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); {308#false} is VALID [2022-04-28 09:00:19,331 INFO L272 TraceCheckUtils]: 13: Hoare triple {308#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {308#false} is VALID [2022-04-28 09:00:19,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-28 09:00:19,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-28 09:00:19,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 09:00:19,334 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:19,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:00:19,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156371930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:19,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:00:19,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-04-28 09:00:19,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:19,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100563242] [2022-04-28 09:00:19,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100563242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:19,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:19,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864227577] [2022-04-28 09:00:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:19,337 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:19,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:19,337 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:19,352 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:19,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:19,354 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,499 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 09:00:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:19,499 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:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:19,500 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:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-28 09:00:19,502 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:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-28 09:00:19,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-28 09:00:19,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:19,561 INFO L225 Difference]: With dead ends: 49 [2022-04-28 09:00:19,561 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 09:00:19,561 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:19,562 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 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:19,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 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:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 09:00:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-28 09:00:19,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:19,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,578 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,578 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,580 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 09:00:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 09:00:19,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:19,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:19,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-28 09:00:19,581 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-28 09:00:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,583 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 09:00:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 09:00:19,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:19,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:19,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:19,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-28 09:00:19,586 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 17 [2022-04-28 09:00:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:19,586 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-28 09:00:19,587 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:19,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-28 09:00:19,634 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:00:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:00:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:00:19,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:19,635 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:19,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:19,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:19,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1131787334, now seen corresponding path program 1 times [2022-04-28 09:00:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [41302265] [2022-04-28 09:00:19,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:19,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1131787334, now seen corresponding path program 2 times [2022-04-28 09:00:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:19,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977932466] [2022-04-28 09:00:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#(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); {603#true} is VALID [2022-04-28 09:00:20,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-28 09:00:20,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {603#true} {603#true} #94#return; {603#true} is VALID [2022-04-28 09:00:20,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:20,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#(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); {603#true} is VALID [2022-04-28 09:00:20,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-28 09:00:20,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #94#return; {603#true} is VALID [2022-04-28 09:00:20,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret15 := main(); {603#true} is VALID [2022-04-28 09:00:20,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#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; {608#(= main_~j~0 0)} is VALID [2022-04-28 09:00:20,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(= 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; {608#(= main_~j~0 0)} is VALID [2022-04-28 09:00:20,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {609#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:20,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {611#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 09:00:20,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {604#false} is VALID [2022-04-28 09:00:20,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#false} #t~short10 := ~i~0 >= 0; {604#false} is VALID [2022-04-28 09:00:20,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {604#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; {604#false} is VALID [2022-04-28 09:00:20,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {604#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {604#false} is VALID [2022-04-28 09:00:20,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {604#false} is VALID [2022-04-28 09:00:20,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {604#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {604#false} is VALID [2022-04-28 09:00:20,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {604#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {604#false} is VALID [2022-04-28 09:00:20,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {604#false} ~k~0 := 1; {604#false} is VALID [2022-04-28 09:00:20,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#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); {604#false} is VALID [2022-04-28 09:00:20,049 INFO L272 TraceCheckUtils]: 19: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {604#false} is VALID [2022-04-28 09:00:20,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2022-04-28 09:00:20,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2022-04-28 09:00:20,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-04-28 09:00:20,051 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:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977932466] [2022-04-28 09:00:20,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977932466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500019574] [2022-04-28 09:00:20,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:20,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:20,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:20,056 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:20,095 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:20,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:20,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:20,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:00:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:20,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:20,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2022-04-28 09:00:20,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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); {603#true} is VALID [2022-04-28 09:00:20,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-28 09:00:20,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #94#return; {603#true} is VALID [2022-04-28 09:00:20,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret15 := main(); {603#true} is VALID [2022-04-28 09:00:20,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#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; {608#(= main_~j~0 0)} is VALID [2022-04-28 09:00:20,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(= 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; {608#(= main_~j~0 0)} is VALID [2022-04-28 09:00:20,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {609#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:20,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#(<= 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; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#(<= 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; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#(<= 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); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:20,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {667#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 09:00:20,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {667#(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); {604#false} is VALID [2022-04-28 09:00:20,719 INFO L272 TraceCheckUtils]: 19: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {604#false} is VALID [2022-04-28 09:00:20,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2022-04-28 09:00:20,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2022-04-28 09:00:20,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-04-28 09:00:20,719 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:20,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:21,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-04-28 09:00:21,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2022-04-28 09:00:21,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2022-04-28 09:00:21,189 INFO L272 TraceCheckUtils]: 19: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {604#false} is VALID [2022-04-28 09:00:21,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {695#(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); {604#false} is VALID [2022-04-28 09:00:21,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {695#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 09:00:21,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#(<= 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); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#(<= 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; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#(<= 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; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {726#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {610#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:21,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {726#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} is VALID [2022-04-28 09:00:21,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#(<= 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; {730#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-28 09:00:21,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#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; {730#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-28 09:00:21,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret15 := main(); {603#true} is VALID [2022-04-28 09:00:21,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #94#return; {603#true} is VALID [2022-04-28 09:00:21,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-28 09:00:21,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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); {603#true} is VALID [2022-04-28 09:00:21,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2022-04-28 09:00:21,215 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:21,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500019574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:21,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:21,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-28 09:00:21,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:21,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [41302265] [2022-04-28 09:00:21,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [41302265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:21,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:21,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:00:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534106202] [2022-04-28 09:00:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:21,217 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:21,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:21,217 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:21,241 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:21,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:00:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:00:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:00:21,242 INFO L87 Difference]: Start difference. First operand 30 states and 35 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:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:21,549 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-28 09:00:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:00:21,550 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:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:21,550 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:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-28 09:00:21,553 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:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-28 09:00:21,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-28 09:00:21,619 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:21,620 INFO L225 Difference]: With dead ends: 61 [2022-04-28 09:00:21,620 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 09:00:21,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:21,622 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:21,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 44 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 09:00:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-04-28 09:00:21,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:21,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:21,645 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:21,646 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:21,649 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-28 09:00:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-28 09:00:21,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:21,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:21,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-04-28 09:00:21,651 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-04-28 09:00:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:21,653 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-28 09:00:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-28 09:00:21,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:21,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:21,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:21,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 09:00:21,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 23 [2022-04-28 09:00:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:21,659 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 09:00:21,660 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:21,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 09:00:21,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 09:00:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:00:21,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:21,700 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:21,716 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:21,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:00:21,904 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1068097608, now seen corresponding path program 3 times [2022-04-28 09:00:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:21,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [796272280] [2022-04-28 09:00:21,921 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:21,921 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1068097608, now seen corresponding path program 4 times [2022-04-28 09:00:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:21,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693051720] [2022-04-28 09:00:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#(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); {1026#true} is VALID [2022-04-28 09:00:22,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-28 09:00:22,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1026#true} {1026#true} #94#return; {1026#true} is VALID [2022-04-28 09:00:22,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:22,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#(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); {1026#true} is VALID [2022-04-28 09:00:22,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-28 09:00:22,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #94#return; {1026#true} is VALID [2022-04-28 09:00:22,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret15 := main(); {1026#true} is VALID [2022-04-28 09:00:22,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#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; {1031#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:22,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(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; {1031#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:22,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1032#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:22,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(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; {1032#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:22,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(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; {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:22,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:22,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1033#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1032#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:22,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(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; {1034#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:00:22,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1034#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {1035#(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:22,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#(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; {1036#(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:22,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {1036#(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; {1037#(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:22,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {1037#(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); {1038#(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:22,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#(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; {1039#(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:22,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {1039#(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); {1039#(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:22,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {1039#(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; {1040#(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:22,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {1040#(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); {1041#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:22,494 INFO L272 TraceCheckUtils]: 21: Hoare triple {1041#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1042#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {1042#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1043#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {1043#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1027#false} is VALID [2022-04-28 09:00:22,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-28 09:00:22,495 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:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693051720] [2022-04-28 09:00:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693051720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669165273] [2022-04-28 09:00:22,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:22,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:00:22,528 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:22,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:22,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:22,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:00:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:22,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:22,987 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:23,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:23,140 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:23,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2022-04-28 09:00:23,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#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); {1026#true} is VALID [2022-04-28 09:00:23,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-28 09:00:23,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #94#return; {1026#true} is VALID [2022-04-28 09:00:23,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret15 := main(); {1026#true} is VALID [2022-04-28 09:00:23,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#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; {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:23,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#(= |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; {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:23,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:23,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#(= |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; {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:23,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:23,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1033#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:23,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {1033#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1032#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:23,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(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; {1084#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-28 09:00:23,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1084#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1088#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-28 09:00:23,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {1088#(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; {1092#(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:23,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#(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; {1096#(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:23,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {1096#(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); {1039#(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:23,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {1039#(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; {1039#(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:23,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {1039#(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); {1039#(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:23,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {1039#(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; {1040#(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:23,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {1040#(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); {1041#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:23,231 INFO L272 TraceCheckUtils]: 21: Hoare triple {1041#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:23,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:23,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1027#false} is VALID [2022-04-28 09:00:23,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-28 09:00:23,232 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:23,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:23,656 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:23,686 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 09:00:23,687 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:23,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-28 09:00:23,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1027#false} is VALID [2022-04-28 09:00:23,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:23,864 INFO L272 TraceCheckUtils]: 21: Hoare triple {1041#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:23,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#(<= (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); {1041#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:23,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {1142#(<= (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; {1138#(<= (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:23,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {1142#(<= (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); {1142#(<= (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:23,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {1142#(<= (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; {1142#(<= (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:23,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {1152#(forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1142#(<= (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:23,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#(or |main_#t~short10| (forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1152#(forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:23,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#(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; {1156#(or |main_#t~short10| (forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-28 09:00:23,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1164#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {1160#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:23,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {1168#(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; {1164#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1026#true} ~j~0 := 1; {1168#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1026#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1026#true} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {1026#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1026#true} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {1026#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; {1026#true} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {1026#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1026#true} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {1026#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; {1026#true} is VALID [2022-04-28 09:00:23,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#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; {1026#true} is VALID [2022-04-28 09:00:23,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret15 := main(); {1026#true} is VALID [2022-04-28 09:00:23,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #94#return; {1026#true} is VALID [2022-04-28 09:00:23,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-28 09:00:23,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#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); {1026#true} is VALID [2022-04-28 09:00:23,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2022-04-28 09:00:23,877 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:23,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669165273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:23,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:23,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-28 09:00:23,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:23,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [796272280] [2022-04-28 09:00:23,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [796272280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:23,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:23,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:00:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861372048] [2022-04-28 09:00:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:23,879 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:23,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:23,879 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:23,905 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:23,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:00:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:00:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:00:23,907 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:25,061 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 09:00:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 09:00:25,061 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,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:25,062 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:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2022-04-28 09:00:25,065 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:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2022-04-28 09:00:25,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2022-04-28 09:00:25,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:25,158 INFO L225 Difference]: With dead ends: 83 [2022-04-28 09:00:25,158 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 09:00:25,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:00:25,160 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 97 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:25,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 61 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:00:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 09:00:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-04-28 09:00:25,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:25,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:25,224 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:25,225 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:25,228 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 09:00:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 09:00:25,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:25,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:25,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 64 states. [2022-04-28 09:00:25,229 INFO L87 Difference]: Start difference. First operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 64 states. [2022-04-28 09:00:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:25,232 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 09:00:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 09:00:25,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:25,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:25,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:25,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 09:00:25,234 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 25 [2022-04-28 09:00:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:25,234 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 09:00:25,235 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:25,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 09:00:25,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 09:00:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:00:25,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:25,302 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:25,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:25,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:25,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash -367033030, now seen corresponding path program 1 times [2022-04-28 09:00:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:25,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1632817012] [2022-04-28 09:00:25,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:25,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash -367033030, now seen corresponding path program 2 times [2022-04-28 09:00:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:25,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506957367] [2022-04-28 09:00:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:25,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {1633#(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); {1625#true} is VALID [2022-04-28 09:00:25,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-28 09:00:25,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1625#true} {1625#true} #94#return; {1625#true} is VALID [2022-04-28 09:00:25,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {1625#true} call ULTIMATE.init(); {1633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:25,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {1633#(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); {1625#true} is VALID [2022-04-28 09:00:25,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume true; {1625#true} is VALID [2022-04-28 09:00:25,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1625#true} #94#return; {1625#true} is VALID [2022-04-28 09:00:25,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {1625#true} call #t~ret15 := main(); {1625#true} is VALID [2022-04-28 09:00:25,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {1625#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; {1625#true} is VALID [2022-04-28 09:00:25,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#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; {1625#true} is VALID [2022-04-28 09:00:25,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1625#true} is VALID [2022-04-28 09:00:25,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#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; {1625#true} is VALID [2022-04-28 09:00:25,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1625#true} is VALID [2022-04-28 09:00:25,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1625#true} is VALID [2022-04-28 09:00:25,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#true} ~j~0 := 1; {1630#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 09:00:25,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(= (+ (- 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; {1631#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 09:00:25,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1631#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {1632#|main_#t~short10|} is VALID [2022-04-28 09:00:25,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1632#|main_#t~short10|} assume !#t~short10; {1626#false} is VALID [2022-04-28 09:00:25,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1626#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1626#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {1626#false} ~k~0 := 1; {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {1626#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); {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L272 TraceCheckUtils]: 21: Hoare triple {1626#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1626#false} is VALID [2022-04-28 09:00:25,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {1626#false} ~cond := #in~cond; {1626#false} is VALID [2022-04-28 09:00:25,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {1626#false} assume 0 == ~cond; {1626#false} is VALID [2022-04-28 09:00:25,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {1626#false} assume !false; {1626#false} is VALID [2022-04-28 09:00:25,597 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:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:25,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506957367] [2022-04-28 09:00:25,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506957367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:25,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:25,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:25,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:25,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1632817012] [2022-04-28 09:00:25,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1632817012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:25,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:25,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213516381] [2022-04-28 09:00:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:25,599 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:25,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:25,599 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:25,616 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:25,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:25,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:00:25,617 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:25,915 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-28 09:00:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:00:25,915 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:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:25,917 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:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 09:00:25,923 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:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 09:00:25,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 09:00:26,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:26,022 INFO L225 Difference]: With dead ends: 92 [2022-04-28 09:00:26,023 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 09:00:26,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:00:26,024 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:26,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 42 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 09:00:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-04-28 09:00:26,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:26,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:26,083 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:26,083 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:26,085 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 09:00:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 09:00:26,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:26,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:26,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-28 09:00:26,086 INFO L87 Difference]: Start difference. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-28 09:00:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:26,087 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 09:00:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 09:00:26,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:26,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:26,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:26,088 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:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-04-28 09:00:26,090 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 25 [2022-04-28 09:00:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:26,090 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-04-28 09:00:26,090 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:26,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 59 transitions. [2022-04-28 09:00:26,156 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:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-04-28 09:00:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:00:26,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:26,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:26,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 09:00:26,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:26,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1586594931, now seen corresponding path program 1 times [2022-04-28 09:00:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:26,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878363561] [2022-04-28 09:00:26,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:26,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1586594931, now seen corresponding path program 2 times [2022-04-28 09:00:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:26,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477543967] [2022-04-28 09:00:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:26,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:26,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {2062#(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); {2040#true} is VALID [2022-04-28 09:00:26,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#true} assume true; {2040#true} is VALID [2022-04-28 09:00:26,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2040#true} {2040#true} #94#return; {2040#true} is VALID [2022-04-28 09:00:26,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {2040#true} call ULTIMATE.init(); {2062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:26,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {2062#(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); {2040#true} is VALID [2022-04-28 09:00:26,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {2040#true} assume true; {2040#true} is VALID [2022-04-28 09:00:26,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2040#true} {2040#true} #94#return; {2040#true} is VALID [2022-04-28 09:00:26,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {2040#true} call #t~ret15 := main(); {2040#true} is VALID [2022-04-28 09:00:26,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {2040#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; {2045#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:26,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {2045#(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; {2045#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:26,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {2045#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:26,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {2046#(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; {2046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:26,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2046#(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; {2047#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:26,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {2047#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2047#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:26,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {2047#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {2046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:26,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {2046#(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; {2048#(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:26,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#(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; {2049#(and (= |main_~#v~0.offset| 0) (or (and (= (+ (- 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:26,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {2049#(and (= |main_~#v~0.offset| 0) (or (and (= (+ (- 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; {2050#(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:00:26,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(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; {2051#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:26,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {2051#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {2052#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:26,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {2052#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {2053#(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:26,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {2053#(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; {2054#(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:26,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {2054#(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; {2055#(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:26,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {2055#(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; {2055#(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:26,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {2055#(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); {2056#(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:26,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {2056#(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; {2057#(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:26,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {2057#(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); {2057#(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:26,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {2057#(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; {2058#(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:26,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {2058#(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); {2059#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:00:26,727 INFO L272 TraceCheckUtils]: 26: Hoare triple {2059#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2060#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:26,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {2060#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2061#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:26,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {2061#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2041#false} is VALID [2022-04-28 09:00:26,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {2041#false} assume !false; {2041#false} is VALID [2022-04-28 09:00:26,729 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:26,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477543967] [2022-04-28 09:00:26,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477543967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685913689] [2022-04-28 09:00:26,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:26,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:26,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:26,731 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:26,742 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:26,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:26,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:26,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:00:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:26,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:27,067 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-28 09:00:27,068 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:27,433 INFO L356 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-04-28 09:00:27,434 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:00:27,910 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-28 09:00:27,911 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:00:28,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {2040#true} call ULTIMATE.init(); {2040#true} is VALID [2022-04-28 09:00:28,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#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); {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {2040#true} assume true; {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2040#true} {2040#true} #94#return; {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {2040#true} call #t~ret15 := main(); {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2040#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:28,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {2040#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2040#true} is VALID [2022-04-28 09:00:28,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {2040#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2040#true} is VALID [2022-04-28 09:00:28,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {2040#true} ~j~0 := 1; {2099#(= main_~j~0 1)} is VALID [2022-04-28 09:00:28,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {2099#(= 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; {2103#(= (+ main_~i~0 1) 1)} is VALID [2022-04-28 09:00:28,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {2103#(= (+ main_~i~0 1) 1)} #t~short10 := ~i~0 >= 0; {2107#(and |main_#t~short10| (= (+ main_~i~0 1) 1))} is VALID [2022-04-28 09:00:28,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {2107#(and |main_#t~short10| (= (+ 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; {2111#(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 0))} is VALID [2022-04-28 09:00:28,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {2111#(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 0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {2115#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= main_~i~0 0))} is VALID [2022-04-28 09:00:28,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {2115#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= main_~i~0 0))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {2119#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= main_~i~0 0))} is VALID [2022-04-28 09:00:28,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {2119#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= main_~i~0 0))} ~i~0 := ~i~0 - 1; {2123#(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:00:28,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {2123#(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; {2127#(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:00:28,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {2127#(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; {2131#(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:00:28,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {2131#(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; {2131#(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:00:28,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {2131#(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); {2138#(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:00:28,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(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; {2138#(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:00:28,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(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); {2138#(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:00:28,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {2138#(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; {2148#(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:00:28,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {2148#(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); {2059#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:00:28,049 INFO L272 TraceCheckUtils]: 26: Hoare triple {2059#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:28,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:28,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {2159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2041#false} is VALID [2022-04-28 09:00:28,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {2041#false} assume !false; {2041#false} is VALID [2022-04-28 09:00:28,052 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:28,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:32,426 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:32,507 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-28 09:00:32,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 771 treesize of output 711 [2022-04-28 09:00:34,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {2041#false} assume !false; {2041#false} is VALID [2022-04-28 09:00:34,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {2159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2041#false} is VALID [2022-04-28 09:00:34,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:34,864 INFO L272 TraceCheckUtils]: 26: Hoare triple {2175#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:34,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {2179#(<= (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); {2175#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:34,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {2183#(<= (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; {2179#(<= (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:34,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {2183#(<= (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); {2183#(<= (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:34,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {2183#(<= (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; {2183#(<= (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:34,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {2193#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2183#(<= (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:34,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {2193#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2193#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:34,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {2200#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {2193#(forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:34,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {2204#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {2200#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:00:34,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {2208#(forall ((v_main_~i~0_14 Int)) (or (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 v_main_~i~0_14)))} ~i~0 := ~i~0 - 1; {2204#(or (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 main_~i~0))} is VALID [2022-04-28 09:00:34,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#(forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70))))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {2208#(forall ((v_main_~i~0_14 Int)) (or (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (forall ((v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))))) (<= 0 v_main_~i~0_14)))} is VALID [2022-04-28 09:00:34,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {2216#(or (not |main_#t~short10|) (forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70)))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {2212#(forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70))))} is VALID [2022-04-28 09:00:34,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {2220#(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; {2216#(or (not |main_#t~short10|) (forall ((v_ArrVal_70 Int) (v_main_~i~0_14 Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 main_~key~0)) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_70) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_72) (+ |main_~#v~0.offset| 4))) (<= 0 v_main_~i~0_14) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_70)))))} is VALID [2022-04-28 09:00:34,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {2040#true} #t~short10 := ~i~0 >= 0; {2220#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:34,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:34,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {2040#true} ~j~0 := 1; {2040#true} is VALID [2022-04-28 09:00:34,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {2040#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2040#true} is VALID [2022-04-28 09:00:34,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {2040#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2040#true} is VALID [2022-04-28 09:00:34,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:34,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {2040#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2040#true} is VALID [2022-04-28 09:00:34,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:34,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {2040#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; {2040#true} is VALID [2022-04-28 09:00:34,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {2040#true} call #t~ret15 := main(); {2040#true} is VALID [2022-04-28 09:00:34,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2040#true} {2040#true} #94#return; {2040#true} is VALID [2022-04-28 09:00:34,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {2040#true} assume true; {2040#true} is VALID [2022-04-28 09:00:34,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#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); {2040#true} is VALID [2022-04-28 09:00:34,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {2040#true} call ULTIMATE.init(); {2040#true} is VALID [2022-04-28 09:00:34,880 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:34,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685913689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:34,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:34,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 14] total 43 [2022-04-28 09:00:34,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:34,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878363561] [2022-04-28 09:00:34,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878363561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:34,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:34,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 09:00:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776115635] [2022-04-28 09:00:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:34,882 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 09:00:34,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:34,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:34,906 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:34,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 09:00:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 09:00:34,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1590, Unknown=5, NotChecked=0, Total=1806 [2022-04-28 09:00:34,908 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:36,607 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2022-04-28 09:00:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 09:00:36,607 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 09:00:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-28 09:00:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-28 09:00:36,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2022-04-28 09:00:36,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:36,732 INFO L225 Difference]: With dead ends: 126 [2022-04-28 09:00:36,732 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 09:00:36,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=468, Invalid=3433, Unknown=5, NotChecked=0, Total=3906 [2022-04-28 09:00:36,734 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:36,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 61 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:00:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 09:00:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2022-04-28 09:00:36,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:36,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:36,837 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:36,837 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:36,841 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2022-04-28 09:00:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-04-28 09:00:36,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:36,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:36,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 91 states. [2022-04-28 09:00:36,842 INFO L87 Difference]: Start difference. First operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 91 states. [2022-04-28 09:00:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:36,848 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2022-04-28 09:00:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-04-28 09:00:36,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:36,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:36,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:36,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2022-04-28 09:00:36,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 30 [2022-04-28 09:00:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:36,851 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2022-04-28 09:00:36,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:36,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 66 transitions. [2022-04-28 09:00:36,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-28 09:00:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 09:00:36,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:36,931 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:36,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 09:00:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:37,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash 932991851, now seen corresponding path program 5 times [2022-04-28 09:00:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169974564] [2022-04-28 09:00:37,151 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:37,151 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 932991851, now seen corresponding path program 6 times [2022-04-28 09:00:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629053872] [2022-04-28 09:00:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:37,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:37,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {2862#(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); {2851#true} is VALID [2022-04-28 09:00:37,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-28 09:00:37,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2851#true} {2851#true} #94#return; {2851#true} is VALID [2022-04-28 09:00:37,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {2851#true} call ULTIMATE.init(); {2862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:37,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {2862#(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); {2851#true} is VALID [2022-04-28 09:00:37,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-28 09:00:37,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2851#true} {2851#true} #94#return; {2851#true} is VALID [2022-04-28 09:00:37,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {2851#true} call #t~ret15 := main(); {2851#true} is VALID [2022-04-28 09:00:37,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {2851#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; {2856#(= main_~j~0 0)} is VALID [2022-04-28 09:00:37,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {2856#(= 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; {2856#(= main_~j~0 0)} is VALID [2022-04-28 09:00:37,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2856#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2857#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:37,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {2857#(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; {2857#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:37,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {2857#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2858#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:37,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {2858#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2859#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:37,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {2859#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2860#(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; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {2860#(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; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {2860#(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; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(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); {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {2860#(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; {2861#(<= (+ 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:37,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {2861#(<= (+ 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; {2852#false} is VALID [2022-04-28 09:00:37,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#false} #t~short10 := ~i~0 >= 0; {2852#false} is VALID [2022-04-28 09:00:37,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#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; {2852#false} is VALID [2022-04-28 09:00:37,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {2852#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2852#false} is VALID [2022-04-28 09:00:37,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {2852#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2852#false} is VALID [2022-04-28 09:00:37,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {2852#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {2852#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {2852#false} ~k~0 := 1; {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {2852#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); {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L272 TraceCheckUtils]: 27: Hoare triple {2852#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {2852#false} ~cond := #in~cond; {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {2852#false} assume 0 == ~cond; {2852#false} is VALID [2022-04-28 09:00:37,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {2852#false} assume !false; {2852#false} is VALID [2022-04-28 09:00:37,314 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,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629053872] [2022-04-28 09:00:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629053872] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362937990] [2022-04-28 09:00:37,314 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:00:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:37,316 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:37,344 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:37,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:00:37,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:37,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:00:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:37,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:37,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {2851#true} call ULTIMATE.init(); {2851#true} is VALID [2022-04-28 09:00:37,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#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); {2851#true} is VALID [2022-04-28 09:00:37,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-28 09:00:37,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2851#true} {2851#true} #94#return; {2851#true} is VALID [2022-04-28 09:00:37,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {2851#true} call #t~ret15 := main(); {2851#true} is VALID [2022-04-28 09:00:37,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {2851#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; {2856#(= main_~j~0 0)} is VALID [2022-04-28 09:00:37,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {2856#(= 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; {2856#(= main_~j~0 0)} is VALID [2022-04-28 09:00:37,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {2856#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2857#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:37,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {2857#(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; {2857#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:37,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {2857#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2858#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:37,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {2858#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2859#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:37,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {2859#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {2860#(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; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {2860#(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; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {2860#(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; {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(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); {2860#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {2860#(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; {2917#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:37,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {2917#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#false} #t~short10 := ~i~0 >= 0; {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#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; {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {2852#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {2852#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {2852#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {2852#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {2852#false} ~k~0 := 1; {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {2852#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); {2852#false} is VALID [2022-04-28 09:00:37,883 INFO L272 TraceCheckUtils]: 27: Hoare triple {2852#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2852#false} is VALID [2022-04-28 09:00:37,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {2852#false} ~cond := #in~cond; {2852#false} is VALID [2022-04-28 09:00:37,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {2852#false} assume 0 == ~cond; {2852#false} is VALID [2022-04-28 09:00:37,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {2852#false} assume !false; {2852#false} is VALID [2022-04-28 09:00:37,884 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,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:38,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {2852#false} assume !false; {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {2852#false} assume 0 == ~cond; {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {2852#false} ~cond := #in~cond; {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L272 TraceCheckUtils]: 27: Hoare triple {2852#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {2852#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); {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {2852#false} ~k~0 := 1; {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {2852#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {2852#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {2852#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2852#false} is VALID [2022-04-28 09:00:38,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {2852#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2852#false} is VALID [2022-04-28 09:00:38,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#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; {2852#false} is VALID [2022-04-28 09:00:38,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#false} #t~short10 := ~i~0 >= 0; {2852#false} is VALID [2022-04-28 09:00:38,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {2861#(<= (+ 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; {2852#false} is VALID [2022-04-28 09:00:38,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {2996#(<= (+ 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; {2861#(<= (+ 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,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {2996#(<= (+ 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); {2996#(<= (+ 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,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {2996#(<= (+ 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; {2996#(<= (+ 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,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {2996#(<= (+ 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; {2996#(<= (+ 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,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {2996#(<= (+ 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; {2996#(<= (+ 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,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {2996#(<= (+ 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; {2996#(<= (+ 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,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {2859#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2996#(<= (+ 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,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {3018#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2859#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:00:38,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {3022#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3018#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-28 09:00:38,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {3022#(<= 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; {3022#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 09:00:38,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {3029#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3022#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 09:00:38,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {3029#(<= 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; {3029#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 09:00:38,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {2851#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; {3029#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 09:00:38,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {2851#true} call #t~ret15 := main(); {2851#true} is VALID [2022-04-28 09:00:38,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2851#true} {2851#true} #94#return; {2851#true} is VALID [2022-04-28 09:00:38,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-28 09:00:38,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#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); {2851#true} is VALID [2022-04-28 09:00:38,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2851#true} call ULTIMATE.init(); {2851#true} is VALID [2022-04-28 09:00:38,349 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,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362937990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:38,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:38,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-28 09:00:38,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:38,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169974564] [2022-04-28 09:00:38,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169974564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:38,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:38,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448028070] [2022-04-28 09:00:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:38,351 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,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:38,352 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,384 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,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:00:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:00:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:38,385 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:39,322 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-04-28 09:00:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:00:39,322 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,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:39,324 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,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-28 09:00:39,326 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,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-28 09:00:39,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-28 09:00:39,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:39,417 INFO L225 Difference]: With dead ends: 147 [2022-04-28 09:00:39,417 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 09:00:39,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:00:39,419 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 129 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:39,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 60 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 09:00:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-04-28 09:00:39,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:39,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:39,635 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:39,635 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:39,638 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-04-28 09:00:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-04-28 09:00:39,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:39,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:39,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 107 states. [2022-04-28 09:00:39,639 INFO L87 Difference]: Start difference. First operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 107 states. [2022-04-28 09:00:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:39,644 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-04-28 09:00:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-04-28 09:00:39,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:39,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:39,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:39,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-04-28 09:00:39,647 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 31 [2022-04-28 09:00:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:39,647 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-04-28 09:00:39,647 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,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 83 transitions. [2022-04-28 09:00:39,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-28 09:00:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:00:39,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:39,763 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,779 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,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:39,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 912710034, now seen corresponding path program 1 times [2022-04-28 09:00:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:39,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038054469] [2022-04-28 09:00:39,976 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:39,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash 912710034, now seen corresponding path program 2 times [2022-04-28 09:00:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:39,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678169531] [2022-04-28 09:00:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:40,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {3730#(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); {3715#true} is VALID [2022-04-28 09:00:40,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:40,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3715#true} {3715#true} #94#return; {3715#true} is VALID [2022-04-28 09:00:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:00:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:40,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {3715#true} ~cond := #in~cond; {3715#true} is VALID [2022-04-28 09:00:40,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3715#true} assume !(0 == ~cond); {3715#true} is VALID [2022-04-28 09:00:40,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:40,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3715#true} {3724#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #92#return; {3724#(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:40,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {3715#true} call ULTIMATE.init(); {3730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:40,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3730#(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); {3715#true} is VALID [2022-04-28 09:00:40,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:40,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3715#true} {3715#true} #94#return; {3715#true} is VALID [2022-04-28 09:00:40,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {3715#true} call #t~ret15 := main(); {3715#true} is VALID [2022-04-28 09:00:40,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {3715#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; {3720#(= main_~j~0 0)} is VALID [2022-04-28 09:00:40,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {3720#(= 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; {3720#(= main_~j~0 0)} is VALID [2022-04-28 09:00:40,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {3720#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3721#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:40,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {3721#(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; {3721#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:40,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {3721#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3722#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:40,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {3722#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~short10 := ~i~0 >= 0; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {3723#(<= 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); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:40,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~k~0 := 1; {3724#(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:40,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {3724#(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); {3724#(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:40,133 INFO L272 TraceCheckUtils]: 21: Hoare triple {3724#(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)); {3715#true} is VALID [2022-04-28 09:00:40,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#true} ~cond := #in~cond; {3715#true} is VALID [2022-04-28 09:00:40,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {3715#true} assume !(0 == ~cond); {3715#true} is VALID [2022-04-28 09:00:40,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:40,134 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3715#true} {3724#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #92#return; {3724#(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:40,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {3724#(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; {3724#(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:40,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {3724#(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; {3729#(<= (+ 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:40,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {3729#(<= (+ 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); {3716#false} is VALID [2022-04-28 09:00:40,135 INFO L272 TraceCheckUtils]: 29: Hoare triple {3716#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3716#false} is VALID [2022-04-28 09:00:40,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {3716#false} ~cond := #in~cond; {3716#false} is VALID [2022-04-28 09:00:40,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {3716#false} assume 0 == ~cond; {3716#false} is VALID [2022-04-28 09:00:40,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {3716#false} assume !false; {3716#false} is VALID [2022-04-28 09:00:40,136 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:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678169531] [2022-04-28 09:00:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678169531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413452355] [2022-04-28 09:00:40,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:40,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:40,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:40,138 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,142 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,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:40,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:40,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:00:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:40,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:41,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {3715#true} call ULTIMATE.init(); {3715#true} is VALID [2022-04-28 09:00:41,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {3715#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); {3715#true} is VALID [2022-04-28 09:00:41,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:41,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3715#true} {3715#true} #94#return; {3715#true} is VALID [2022-04-28 09:00:41,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {3715#true} call #t~ret15 := main(); {3715#true} is VALID [2022-04-28 09:00:41,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {3715#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; {3720#(= main_~j~0 0)} is VALID [2022-04-28 09:00:41,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {3720#(= 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; {3720#(= main_~j~0 0)} is VALID [2022-04-28 09:00:41,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {3720#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3721#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:41,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {3721#(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; {3721#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:41,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {3721#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3722#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:00:41,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {3722#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~short10 := ~i~0 >= 0; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {3723#(<= 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); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:41,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~k~0 := 1; {3724#(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:41,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {3724#(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); {3724#(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:41,391 INFO L272 TraceCheckUtils]: 21: Hoare triple {3724#(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)); {3715#true} is VALID [2022-04-28 09:00:41,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#true} ~cond := #in~cond; {3715#true} is VALID [2022-04-28 09:00:41,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {3715#true} assume !(0 == ~cond); {3715#true} is VALID [2022-04-28 09:00:41,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:41,392 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3715#true} {3724#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #92#return; {3724#(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:41,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {3724#(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; {3724#(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:41,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {3724#(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; {3815#(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:41,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {3815#(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); {3716#false} is VALID [2022-04-28 09:00:41,394 INFO L272 TraceCheckUtils]: 29: Hoare triple {3716#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3716#false} is VALID [2022-04-28 09:00:41,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {3716#false} ~cond := #in~cond; {3716#false} is VALID [2022-04-28 09:00:41,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {3716#false} assume 0 == ~cond; {3716#false} is VALID [2022-04-28 09:00:41,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {3716#false} assume !false; {3716#false} is VALID [2022-04-28 09:00:41,395 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:41,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:42,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {3716#false} assume !false; {3716#false} is VALID [2022-04-28 09:00:42,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {3716#false} assume 0 == ~cond; {3716#false} is VALID [2022-04-28 09:00:42,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {3716#false} ~cond := #in~cond; {3716#false} is VALID [2022-04-28 09:00:42,733 INFO L272 TraceCheckUtils]: 29: Hoare triple {3716#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3716#false} is VALID [2022-04-28 09:00:42,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {3729#(<= (+ 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); {3716#false} is VALID [2022-04-28 09:00:42,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {3846#(<= (+ 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; {3729#(<= (+ 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:42,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {3846#(<= (+ 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; {3846#(<= (+ 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:42,738 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3715#true} {3846#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #92#return; {3846#(<= (+ 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:42,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:42,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {3715#true} assume !(0 == ~cond); {3715#true} is VALID [2022-04-28 09:00:42,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#true} ~cond := #in~cond; {3715#true} is VALID [2022-04-28 09:00:42,738 INFO L272 TraceCheckUtils]: 21: Hoare triple {3846#(<= (+ 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)); {3715#true} is VALID [2022-04-28 09:00:42,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {3846#(<= (+ 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); {3846#(<= (+ 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:42,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~k~0 := 1; {3846#(<= (+ 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:42,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {3723#(<= 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); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~short10 := ~i~0 >= 0; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {3723#(<= 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; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {3898#(<= 0 (+ 1 (div (+ (- 4294967294) (* (- 1) (mod main_~j~0 4294967296))) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3723#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-28 09:00:42,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {3902#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3898#(<= 0 (+ 1 (div (+ (- 4294967294) (* (- 1) (mod main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-28 09:00:42,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {3902#(<= 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; {3902#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:42,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {3909#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3902#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:42,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {3909#(<= 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; {3909#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:42,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {3715#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; {3909#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-28 09:00:42,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {3715#true} call #t~ret15 := main(); {3715#true} is VALID [2022-04-28 09:00:42,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3715#true} {3715#true} #94#return; {3715#true} is VALID [2022-04-28 09:00:42,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {3715#true} assume true; {3715#true} is VALID [2022-04-28 09:00:42,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {3715#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); {3715#true} is VALID [2022-04-28 09:00:42,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {3715#true} call ULTIMATE.init(); {3715#true} is VALID [2022-04-28 09:00:42,746 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:42,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413452355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:42,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:42,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-28 09:00:42,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:42,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038054469] [2022-04-28 09:00:42,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038054469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:42,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:42,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543560976] [2022-04-28 09:00:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-28 09:00:42,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:42,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:42,772 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:42,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:00:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:00:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:42,773 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:43,738 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2022-04-28 09:00:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:00:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-28 09:00:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 09:00:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 09:00:43,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-28 09:00:43,831 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:43,833 INFO L225 Difference]: With dead ends: 116 [2022-04-28 09:00:43,833 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 09:00:43,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:00:43,834 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 106 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:43,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 64 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 09:00:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-04-28 09:00:44,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:44,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:44,039 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:44,039 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,041 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-28 09:00:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-28 09:00:44,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:44,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:44,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-28 09:00:44,042 INFO L87 Difference]: Start difference. First operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-28 09:00:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,044 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-28 09:00:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-28 09:00:44,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:44,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:44,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:44,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-28 09:00:44,047 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 33 [2022-04-28 09:00:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:44,047 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-28 09:00:44,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:44,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 76 transitions. [2022-04-28 09:00:44,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-28 09:00:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:00:44,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:44,164 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:44,180 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:44,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:44,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1010087575, now seen corresponding path program 7 times [2022-04-28 09:00:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:44,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283265679] [2022-04-28 09:00:44,370 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:44,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1010087575, now seen corresponding path program 8 times [2022-04-28 09:00:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:44,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511749839] [2022-04-28 09:00:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:44,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {4506#(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); {4485#true} is VALID [2022-04-28 09:00:44,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:44,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4485#true} {4485#true} #94#return; {4485#true} is VALID [2022-04-28 09:00:44,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:44,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {4506#(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); {4485#true} is VALID [2022-04-28 09:00:44,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:44,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #94#return; {4485#true} is VALID [2022-04-28 09:00:44,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret15 := main(); {4485#true} is VALID [2022-04-28 09:00:44,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#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; {4490#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:44,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {4490#(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; {4490#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:44,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {4490#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4491#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:44,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {4491#(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; {4491#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:44,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {4491#(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; {4492#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-28 09:00:44,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {4492#(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; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:44,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {4493#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:44,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:44,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {4493#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4491#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:44,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {4491#(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; {4494#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:00:44,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {4494#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {4495#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-28 09:00:44,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {4495#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4496#(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:44,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {4496#(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; {4497#(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:44,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {4497#(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); {4498#(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:44,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {4498#(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; {4499#(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:00:44,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {4499#(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; {4500#(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:00:44,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {4500#(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; {4500#(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:00:44,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {4500#(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; {4500#(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:00:44,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {4500#(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; {4500#(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:00:44,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {4500#(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); {4501#(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:44,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {4501#(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; {4501#(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:44,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {4501#(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); {4501#(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:44,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {4501#(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; {4502#(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:44,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {4502#(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); {4503#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:44,992 INFO L272 TraceCheckUtils]: 29: Hoare triple {4503#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:44,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {4504#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4505#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:44,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {4505#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4486#false} is VALID [2022-04-28 09:00:44,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-28 09:00:44,993 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:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511749839] [2022-04-28 09:00:44,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511749839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006422025] [2022-04-28 09:00:44,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:44,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:44,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:44,995 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:44,995 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,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:45,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:45,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 09:00:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:45,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:45,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:45,404 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:45,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:45,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:45,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:45,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:45,560 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:00:45,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:45,633 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:45,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-28 09:00:45,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#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); {4485#true} is VALID [2022-04-28 09:00:45,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:45,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #94#return; {4485#true} is VALID [2022-04-28 09:00:45,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret15 := main(); {4485#true} is VALID [2022-04-28 09:00:45,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#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; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {4493#(= |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; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {4493#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {4493#(= |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; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {4493#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {4493#(= |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; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {4493#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4493#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:45,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {4493#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4491#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:45,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {4491#(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; {4494#(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,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {4494#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {4555#(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:45,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#(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; {4496#(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,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {4496#(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; {4497#(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,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {4497#(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); {4498#(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,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {4498#(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; {4499#(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:00:45,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {4499#(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; {4500#(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:00:45,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {4500#(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; {4500#(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:00:45,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {4500#(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; {4500#(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:00:45,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {4500#(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; {4500#(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:00:45,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {4500#(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); {4501#(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,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {4501#(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; {4501#(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,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {4501#(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); {4501#(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,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {4501#(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; {4502#(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,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {4502#(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); {4503#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:45,743 INFO L272 TraceCheckUtils]: 29: Hoare triple {4503#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:45,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {4598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:45,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {4602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4486#false} is VALID [2022-04-28 09:00:45,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-28 09:00:45,744 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:45,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:50,536 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:50,590 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 09:00:50,590 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 373 treesize of output 363 [2022-04-28 09:00:53,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#false} assume !false; {4486#false} is VALID [2022-04-28 09:00:53,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {4602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4486#false} is VALID [2022-04-28 09:00:53,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {4598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:53,401 INFO L272 TraceCheckUtils]: 29: Hoare triple {4503#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:53,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {4621#(<= (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); {4503#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:53,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {4625#(<= (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; {4621#(<= (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:53,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {4625#(<= (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); {4625#(<= (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:53,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {4625#(<= (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; {4625#(<= (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:53,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4625#(<= (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:53,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:00:53,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:00:53,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:00:53,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {4648#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4635#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:00:53,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4648#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:00:53,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {4656#(forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4652#(forall ((v_ArrVal_135 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:00:53,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(or (forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4656#(forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:53,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {4664#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4660#(or (forall ((v_ArrVal_135 Int) (v_ArrVal_134 Int)) (or (not (<= main_~key~0 v_ArrVal_134)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_134) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_135) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:00:53,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {4668#(or (not (<= 0 main_~i~0)) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4664#(or (not |main_#t~short10|) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:00:53,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {4672#(<= 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; {4668#(or (not (<= 0 main_~i~0)) (and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 09:00:53,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#true} ~j~0 := 1; {4672#(<= main_~j~0 1)} is VALID [2022-04-28 09:00:53,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#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; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#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; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#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; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#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; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {4485#true} call #t~ret15 := main(); {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4485#true} {4485#true} #94#return; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#true} assume true; {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#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); {4485#true} is VALID [2022-04-28 09:00:53,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {4485#true} call ULTIMATE.init(); {4485#true} is VALID [2022-04-28 09:00:53,414 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:53,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006422025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:53,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:53,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 32 [2022-04-28 09:00:53,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283265679] [2022-04-28 09:00:53,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283265679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:53,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:53,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 09:00:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404951244] [2022-04-28 09:00:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:53,415 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:00:53,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:53,415 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:00:53,442 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:53,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 09:00:53,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 09:00:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=859, Unknown=2, NotChecked=0, Total=992 [2022-04-28 09:00:53,443 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:55,493 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2022-04-28 09:00:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 09:00:55,493 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:00:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:55,494 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:00:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 133 transitions. [2022-04-28 09:00:55,499 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:00:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 133 transitions. [2022-04-28 09:00:55,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 133 transitions. [2022-04-28 09:00:55,632 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:00:55,634 INFO L225 Difference]: With dead ends: 174 [2022-04-28 09:00:55,634 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 09:00:55,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=350, Invalid=2098, Unknown=2, NotChecked=0, Total=2450 [2022-04-28 09:00:55,637 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 182 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:55,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 67 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:00:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 09:00:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2022-04-28 09:00:55,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:55,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:55,871 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:55,872 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:55,878 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-28 09:00:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-28 09:00:55,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:55,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:55,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 134 states. [2022-04-28 09:00:55,880 INFO L87 Difference]: Start difference. First operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 134 states. [2022-04-28 09:00:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:55,883 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-28 09:00:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-28 09:00:55,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:55,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:55,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:55,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-04-28 09:00:55,886 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 33 [2022-04-28 09:00:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:55,886 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-04-28 09:00:55,886 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:00:55,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 87 transitions. [2022-04-28 09:00:56,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-04-28 09:00:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:00:56,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:56,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:56,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 09:00:56,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:56,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash 925785056, now seen corresponding path program 1 times [2022-04-28 09:00:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:56,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303141730] [2022-04-28 09:00:56,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:56,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 925785056, now seen corresponding path program 2 times [2022-04-28 09:00:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:56,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657671869] [2022-04-28 09:00:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:56,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {5535#(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); {5517#true} is VALID [2022-04-28 09:00:56,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {5517#true} assume true; {5517#true} is VALID [2022-04-28 09:00:56,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5517#true} {5517#true} #94#return; {5517#true} is VALID [2022-04-28 09:00:56,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {5517#true} call ULTIMATE.init(); {5535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:56,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {5535#(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); {5517#true} is VALID [2022-04-28 09:00:56,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {5517#true} assume true; {5517#true} is VALID [2022-04-28 09:00:56,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5517#true} {5517#true} #94#return; {5517#true} is VALID [2022-04-28 09:00:56,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {5517#true} call #t~ret15 := main(); {5517#true} is VALID [2022-04-28 09:00:56,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {5517#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; {5522#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:56,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {5522#(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; {5522#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:56,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {5522#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#(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; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {5523#(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; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:56,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {5524#(= |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; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:56,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {5524#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:56,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {5524#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:56,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {5524#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {5523#(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; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {5523#(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; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {5523#(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); {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:56,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(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; {5525#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-28 09:00:56,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {5525#(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; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {5526#(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; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {5527#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {5527#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5527#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:56,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {5527#(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; {5528#(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:00:56,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {5528#(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; {5529#(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:56,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {5529#(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); {5530#(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:56,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#(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; {5530#(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:56,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#(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); {5530#(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:56,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {5530#(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; {5531#(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:56,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {5531#(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); {5532#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:56,602 INFO L272 TraceCheckUtils]: 34: Hoare triple {5532#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5533#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:56,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {5533#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5534#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:56,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {5534#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5518#false} is VALID [2022-04-28 09:00:56,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {5518#false} assume !false; {5518#false} is VALID [2022-04-28 09:00:56,604 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:00:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657671869] [2022-04-28 09:00:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657671869] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519829056] [2022-04-28 09:00:56,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:56,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:56,608 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:00:56,627 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:00:56,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:56,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:56,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:00:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:56,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:57,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:00:57,173 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:57,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:00:57,320 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:57,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {5517#true} call ULTIMATE.init(); {5517#true} is VALID [2022-04-28 09:00:57,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {5517#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); {5517#true} is VALID [2022-04-28 09:00:57,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {5517#true} assume true; {5517#true} is VALID [2022-04-28 09:00:57,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5517#true} {5517#true} #94#return; {5517#true} is VALID [2022-04-28 09:00:57,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {5517#true} call #t~ret15 := main(); {5517#true} is VALID [2022-04-28 09:00:57,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {5517#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; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {5524#(= |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; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {5524#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {5524#(= |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; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {5524#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {5524#(= |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; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {5524#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {5524#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5524#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:00:57,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {5524#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:57,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {5523#(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; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:57,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:57,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {5523#(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; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:57,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:57,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {5523#(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); {5523#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:00:57,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(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; {5525#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-28 09:00:57,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {5525#(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; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:57,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:57,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {5526#(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; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:57,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:57,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:57,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {5526#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {5527#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:57,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {5527#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5617#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)) |main_#t~short10|)} is VALID [2022-04-28 09:00:57,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {5617#(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; {5528#(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:00:57,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {5528#(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; {5529#(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:57,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {5529#(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); {5530#(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:57,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#(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; {5530#(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:57,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#(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); {5530#(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:57,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {5530#(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; {5531#(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:57,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {5531#(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); {5532#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:57,416 INFO L272 TraceCheckUtils]: 34: Hoare triple {5532#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:57,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {5642#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:57,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {5646#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5518#false} is VALID [2022-04-28 09:00:57,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {5518#false} assume !false; {5518#false} is VALID [2022-04-28 09:00:57,417 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:00:57,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:57,787 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:57,827 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 09:00:57,828 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:58,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {5518#false} assume !false; {5518#false} is VALID [2022-04-28 09:00:58,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {5646#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5518#false} is VALID [2022-04-28 09:00:58,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {5642#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:58,151 INFO L272 TraceCheckUtils]: 34: Hoare triple {5532#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:58,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {5665#(<= (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); {5532#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:00:58,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {5669#(<= (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; {5665#(<= (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:58,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {5669#(<= (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); {5669#(<= (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:58,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {5669#(<= (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; {5669#(<= (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:58,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {5679#(forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5669#(<= (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:58,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {5683#(or (forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5679#(forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:00:58,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {5687#(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; {5683#(or (forall ((v_ArrVal_165 Int)) (or (not (<= main_~key~0 v_ArrVal_165)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_165) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:00:58,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {5691#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5687#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:58,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} ~i~0 := ~i~0 - 1; {5691#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 09:00:58,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:00:58,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:00:58,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {5695#(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; {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:00:58,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} #t~short10 := ~i~0 >= 0; {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:00:58,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {5711#(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; {5695#(or (= (+ (- 4) (* main_~i~0 4)) 0) (not (<= 1 main_~i~0)))} is VALID [2022-04-28 09:00:58,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5711#(or (= (+ (* main_~j~0 4) (- 8)) 0) (not (<= 2 main_~j~0)))} is VALID [2022-04-28 09:00:58,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {5715#(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); {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:58,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:58,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {5715#(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; {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:58,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} #t~short10 := ~i~0 >= 0; {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:58,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {5715#(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; {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {5517#true} ~j~0 := 1; {5715#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {5517#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {5517#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {5517#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; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {5517#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {5517#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; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {5517#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {5517#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; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {5517#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; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {5517#true} call #t~ret15 := main(); {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5517#true} {5517#true} #94#return; {5517#true} is VALID [2022-04-28 09:00:58,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {5517#true} assume true; {5517#true} is VALID [2022-04-28 09:00:58,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {5517#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); {5517#true} is VALID [2022-04-28 09:00:58,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {5517#true} call ULTIMATE.init(); {5517#true} is VALID [2022-04-28 09:00:58,162 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:00:58,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519829056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:58,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:00:58,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 28 [2022-04-28 09:00:58,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:58,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303141730] [2022-04-28 09:00:58,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303141730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:58,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:58,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:00:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653386181] [2022-04-28 09:00:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:58,163 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:00:58,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:58,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:58,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:58,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:00:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:58,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:00:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:00:58,192 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:01,522 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-04-28 09:01:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 09:01:01,522 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:01:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 188 transitions. [2022-04-28 09:01:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 188 transitions. [2022-04-28 09:01:01,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 188 transitions. [2022-04-28 09:01:01,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:01,737 INFO L225 Difference]: With dead ends: 234 [2022-04-28 09:01:01,737 INFO L226 Difference]: Without dead ends: 194 [2022-04-28 09:01:01,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 58 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=512, Invalid=2794, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 09:01:01,738 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 205 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:01,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 59 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 09:01:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-28 09:01:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 89. [2022-04-28 09:01:02,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:02,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 89 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 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:02,046 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 89 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 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:02,046 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 89 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 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:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:02,051 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2022-04-28 09:01:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2022-04-28 09:01:02,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:02,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:02,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 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 194 states. [2022-04-28 09:01:02,052 INFO L87 Difference]: Start difference. First operand has 89 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 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 194 states. [2022-04-28 09:01:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:02,058 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2022-04-28 09:01:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2022-04-28 09:01:02,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:02,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:02,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:02,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 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:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2022-04-28 09:01:02,067 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 38 [2022-04-28 09:01:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:02,068 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2022-04-28 09:01:02,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:02,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 110 transitions. [2022-04-28 09:01:02,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-04-28 09:01:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:01:02,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:02,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:02,281 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:01:02,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 09:01:02,466 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 909842600, now seen corresponding path program 3 times [2022-04-28 09:01:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:02,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039794782] [2022-04-28 09:01:02,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:01:02,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 909842600, now seen corresponding path program 4 times [2022-04-28 09:01:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:02,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839946762] [2022-04-28 09:01:02,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:02,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:03,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {6893#(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); {6869#true} is VALID [2022-04-28 09:01:03,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-28 09:01:03,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6869#true} {6869#true} #94#return; {6869#true} is VALID [2022-04-28 09:01:03,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {6869#true} call ULTIMATE.init(); {6893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:03,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#(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); {6869#true} is VALID [2022-04-28 09:01:03,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-28 09:01:03,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6869#true} {6869#true} #94#return; {6869#true} is VALID [2022-04-28 09:01:03,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {6869#true} call #t~ret15 := main(); {6869#true} is VALID [2022-04-28 09:01:03,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {6869#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; {6874#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:01:03,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {6874#(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; {6874#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:01:03,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {6874#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6875#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:03,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {6875#(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; {6875#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:03,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {6875#(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; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:03,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {6876#(= |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; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:03,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {6876#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:03,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {6876#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:03,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {6876#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {6875#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:03,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {6875#(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; {6877#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:01:03,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {6877#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {6878#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (not |main_#t~short10|))} is VALID [2022-04-28 09:01:03,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {6878#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~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; {6879#(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:01:03,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {6879#(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; {6880#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:01:03,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {6880#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6881#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:01:03,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {6881#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} ~i~0 := ~i~0 - 1; {6882#(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))) (not (= 0 (* main_~i~0 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 09:01:03,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {6882#(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))) (not (= 0 (* main_~i~0 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {6883#(and (= (+ (- 1) main_~j~0) 0) (or (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))) |main_#t~short10|))} is VALID [2022-04-28 09:01:03,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {6883#(and (= (+ (- 1) main_~j~0) 0) (or (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))) |main_#t~short10|))} assume !#t~short10; {6884#(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:01:03,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {6884#(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; {6884#(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:01:03,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {6884#(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); {6885#(and (= |main_~#v~0.offset| 0) (= main_~j~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:01:03,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {6885#(and (= |main_~#v~0.offset| 0) (= main_~j~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~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6886#(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:01:03,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {6886#(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; {6887#(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:01:03,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {6887#(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; {6887#(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:01:03,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {6887#(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; {6887#(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:01:03,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {6887#(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; {6887#(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:01:03,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {6887#(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); {6888#(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:01:03,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {6888#(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; {6888#(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:01:03,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {6888#(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); {6888#(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:01:03,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {6888#(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; {6889#(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:01:03,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {6889#(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); {6890#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:01:03,116 INFO L272 TraceCheckUtils]: 34: Hoare triple {6890#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6891#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:03,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {6891#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6892#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:03,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {6892#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6870#false} is VALID [2022-04-28 09:01:03,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {6870#false} assume !false; {6870#false} is VALID [2022-04-28 09:01:03,117 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:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:03,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839946762] [2022-04-28 09:01:03,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839946762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:03,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583247831] [2022-04-28 09:01:03,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:03,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:03,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:03,124 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:01:03,125 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:01:03,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:03,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:03,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:01:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:03,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:03,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:01:03,523 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:01:04,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:01:04,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:01:04,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:01:04,278 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:01:04,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:01:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:01:04,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:01:04,570 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:01:04,570 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:01:04,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:01:04,641 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:01:04,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {6869#true} call ULTIMATE.init(); {6869#true} is VALID [2022-04-28 09:01:04,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {6869#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); {6869#true} is VALID [2022-04-28 09:01:04,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-28 09:01:04,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6869#true} {6869#true} #94#return; {6869#true} is VALID [2022-04-28 09:01:04,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {6869#true} call #t~ret15 := main(); {6869#true} is VALID [2022-04-28 09:01:04,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {6869#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; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {6876#(= |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; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {6876#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {6876#(= |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; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {6876#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {6876#(= |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; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {6876#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {6876#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6876#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:01:04,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {6876#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {6875#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {6875#(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; {6875#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {6875#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6942#(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:01:04,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {6942#(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; {6946#(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:01:04,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {6946#(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; {6950#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= 0 main_~i~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {6950#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= 0 main_~i~0) (<= main_~j~0 1))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6954#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {6954#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0) (<= main_~j~0 1))} ~i~0 := ~i~0 - 1; {6958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {6958#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6962#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= 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:01:04,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {6962#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= 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; {6966#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {6966#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6966#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= main_~j~0 1))} is VALID [2022-04-28 09:01:04,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {6966#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (exists ((v_main_~i~0_26 Int)) (and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4)))) (<= v_main_~i~0_26 (+ main_~i~0 1)) (<= 0 v_main_~i~0_26) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_26 4) 4))))) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6885#(and (= |main_~#v~0.offset| 0) (= main_~j~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:01:04,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {6885#(and (= |main_~#v~0.offset| 0) (= main_~j~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~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6976#(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:01:04,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(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; {6980#(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:01:04,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {6980#(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; {6980#(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:01:04,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {6980#(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; {6980#(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:01:04,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {6980#(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; {6980#(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:01:04,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {6980#(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); {6888#(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:01:04,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {6888#(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; {6888#(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:01:04,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {6888#(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); {6888#(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:01:04,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {6888#(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; {6889#(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:01:04,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {6889#(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); {6890#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 09:01:04,740 INFO L272 TraceCheckUtils]: 34: Hoare triple {6890#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:04,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:04,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6870#false} is VALID [2022-04-28 09:01:04,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {6870#false} assume !false; {6870#false} is VALID [2022-04-28 09:01:04,743 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:01:04,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:25,548 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:01:25,663 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-28 09:01:25,664 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 5867 treesize of output 5673 [2022-04-28 09:04:46,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {6870#false} assume !false; {6870#false} is VALID [2022-04-28 09:04:46,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6870#false} is VALID [2022-04-28 09:04:46,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:04:46,211 INFO L272 TraceCheckUtils]: 34: Hoare triple {7028#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:04:46,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {7032#(<= (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); {7028#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:04:46,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {7036#(<= (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; {7032#(<= (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:04:46,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {7036#(<= (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); {7036#(<= (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:04:46,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {7036#(<= (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; {7036#(<= (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:04:46,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7036#(<= (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:04:46,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:04:46,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |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; {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:04:46,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:04:46,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {7059#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_200) (+ |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; {7046#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:04:46,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {7063#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7059#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:04:46,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {7067#(forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {7063#(forall ((v_ArrVal_200 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 09:04:46,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {7067#(forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {7067#(forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:04:46,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {7074#(or (forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {7067#(forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 09:04:46,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {7078#(or (<= 0 main_~i~0) (forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))))} #t~short10 := ~i~0 >= 0; {7074#(or (forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 09:04:46,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {7082#(forall ((v_main_~i~0_28 Int)) (or (forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))) (not (<= main_~i~0 (+ v_main_~i~0_28 1))) (<= 0 v_main_~i~0_28)))} ~i~0 := ~i~0 - 1; {7078#(or (<= 0 main_~i~0) (forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (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| (* main_~j~0 4) 4) v_ArrVal_200) |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_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-28 09:04:46,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {7086#(forall ((v_ArrVal_200 Int) (v_main_~i~0_28 Int) (v_ArrVal_198 Int) (v_ArrVal_195 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_195)) (not (<= main_~i~0 (+ v_main_~i~0_28 1))) (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |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_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_198 main_~key~0)) (<= 0 v_main_~i~0_28)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {7082#(forall ((v_main_~i~0_28 Int)) (or (forall ((v_ArrVal_200 Int) (v_ArrVal_198 Int)) (or (not (<= v_ArrVal_198 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))))) (not (<= main_~i~0 (+ v_main_~i~0_28 1))) (<= 0 v_main_~i~0_28)))} is VALID [2022-04-28 09:04:46,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {7090#(or (not |main_#t~short10|) (forall ((v_ArrVal_200 Int) (v_main_~i~0_28 Int) (v_ArrVal_198 Int) (v_ArrVal_195 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_195)) (not (<= main_~i~0 (+ v_main_~i~0_28 1))) (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |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_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_198 main_~key~0)) (<= 0 v_main_~i~0_28))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {7086#(forall ((v_ArrVal_200 Int) (v_main_~i~0_28 Int) (v_ArrVal_198 Int) (v_ArrVal_195 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_195)) (not (<= main_~i~0 (+ v_main_~i~0_28 1))) (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |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_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_198 main_~key~0)) (<= 0 v_main_~i~0_28)))} is VALID [2022-04-28 09:04:46,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {7094#(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; {7090#(or (not |main_#t~short10|) (forall ((v_ArrVal_200 Int) (v_main_~i~0_28 Int) (v_ArrVal_198 Int) (v_ArrVal_195 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_195)) (not (<= main_~i~0 (+ v_main_~i~0_28 1))) (<= (select (store (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) |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_195) (+ (* v_main_~i~0_28 4) |main_~#v~0.offset| 4) v_ArrVal_198) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_200) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_198 main_~key~0)) (<= 0 v_main_~i~0_28))))} is VALID [2022-04-28 09:04:46,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {7098#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} #t~short10 := ~i~0 >= 0; {7094#(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:04:46,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {7098#(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; {7098#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} is VALID [2022-04-28 09:04:46,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {6869#true} ~j~0 := 1; {7098#(and (not (= (* main_~j~0 4) 0)) (not (= (+ (* main_~j~0 4) 4) 0)))} is VALID [2022-04-28 09:04:46,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {6869#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6869#true} is VALID [2022-04-28 09:04:46,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {6869#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6869#true} is VALID [2022-04-28 09:04:46,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {6869#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; {6869#true} is VALID [2022-04-28 09:04:46,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {6869#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {6869#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; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {6869#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {6869#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; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {6869#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; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {6869#true} call #t~ret15 := main(); {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6869#true} {6869#true} #94#return; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {6869#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); {6869#true} is VALID [2022-04-28 09:04:46,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {6869#true} call ULTIMATE.init(); {6869#true} is VALID [2022-04-28 09:04:46,237 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:04:46,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583247831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:04:46,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:04:46,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 47 [2022-04-28 09:04:46,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:46,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039794782] [2022-04-28 09:04:46,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039794782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:46,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:46,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 09:04:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197346654] [2022-04-28 09:04:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:04:46,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:46,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:46,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:46,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 09:04:46,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:46,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 09:04:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1900, Unknown=13, NotChecked=0, Total=2162 [2022-04-28 09:04:46,281 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:49,644 INFO L93 Difference]: Finished difference Result 197 states and 247 transitions. [2022-04-28 09:04:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 09:04:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 09:04:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 136 transitions. [2022-04-28 09:04:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 136 transitions. [2022-04-28 09:04:49,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 136 transitions. [2022-04-28 09:04:49,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:49,772 INFO L225 Difference]: With dead ends: 197 [2022-04-28 09:04:49,772 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 09:04:49,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=580, Invalid=4237, Unknown=13, NotChecked=0, Total=4830 [2022-04-28 09:04:49,774 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 113 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:49,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 74 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 09:04:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 09:04:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2022-04-28 09:04:50,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:50,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 106 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 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:04:50,167 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 106 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 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:04:50,168 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 106 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 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:04:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:50,171 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2022-04-28 09:04:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2022-04-28 09:04:50,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:50,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:50,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 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 151 states. [2022-04-28 09:04:50,172 INFO L87 Difference]: Start difference. First operand has 106 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 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 151 states. [2022-04-28 09:04:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:50,175 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2022-04-28 09:04:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2022-04-28 09:04:50,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:50,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:50,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:50,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 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:04:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2022-04-28 09:04:50,178 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 38 [2022-04-28 09:04:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:50,178 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2022-04-28 09:04:50,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:50,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 134 transitions. [2022-04-28 09:04:50,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2022-04-28 09:04:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:04:50,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:50,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:50,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 09:04:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:50,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2114079652, now seen corresponding path program 9 times [2022-04-28 09:04:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:50,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706867009] [2022-04-28 09:04:50,633 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:50,633 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:50,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2114079652, now seen corresponding path program 10 times [2022-04-28 09:04:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:50,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952605906] [2022-04-28 09:04:50,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:50,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {8113#(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); {8100#true} is VALID [2022-04-28 09:04:50,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {8100#true} assume true; {8100#true} is VALID [2022-04-28 09:04:50,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8100#true} {8100#true} #94#return; {8100#true} is VALID [2022-04-28 09:04:50,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {8100#true} call ULTIMATE.init(); {8113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:50,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {8113#(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); {8100#true} is VALID [2022-04-28 09:04:50,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {8100#true} assume true; {8100#true} is VALID [2022-04-28 09:04:50,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8100#true} {8100#true} #94#return; {8100#true} is VALID [2022-04-28 09:04:50,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {8100#true} call #t~ret15 := main(); {8100#true} is VALID [2022-04-28 09:04:50,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {8100#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; {8105#(= main_~j~0 0)} is VALID [2022-04-28 09:04:50,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {8105#(= 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; {8105#(= main_~j~0 0)} is VALID [2022-04-28 09:04:50,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {8105#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8106#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:04:50,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {8106#(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; {8106#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:04:50,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {8106#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8107#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:04:50,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {8107#(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; {8107#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:04:50,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {8107#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8108#(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:04:50,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {8108#(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); {8109#(<= 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:04:50,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {8109#(<= 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; {8110#(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:04:50,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {8110#(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; {8110#(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:04:50,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {8110#(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; {8110#(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:04:50,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {8110#(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; {8110#(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:04:50,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {8110#(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; {8110#(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:04:50,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {8110#(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); {8110#(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:04:50,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {8110#(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; {8111#(<= 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:04:50,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {8111#(<= 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; {8111#(<= 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:04:50,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {8111#(<= 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; {8111#(<= 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:04:50,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {8111#(<= 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; {8111#(<= 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:04:50,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {8111#(<= 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; {8111#(<= 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:04:50,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {8111#(<= 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); {8111#(<= 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:04:50,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {8111#(<= 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; {8112#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:04:50,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {8112#(<= (+ 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; {8101#false} is VALID [2022-04-28 09:04:50,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {8101#false} #t~short10 := ~i~0 >= 0; {8101#false} is VALID [2022-04-28 09:04:50,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {8101#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; {8101#false} is VALID [2022-04-28 09:04:50,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {8101#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8101#false} is VALID [2022-04-28 09:04:50,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {8101#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {8101#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {8101#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {8101#false} ~k~0 := 1; {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {8101#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); {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L272 TraceCheckUtils]: 35: Hoare triple {8101#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {8101#false} ~cond := #in~cond; {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {8101#false} assume 0 == ~cond; {8101#false} is VALID [2022-04-28 09:04:50,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {8101#false} assume !false; {8101#false} is VALID [2022-04-28 09:04:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:04:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952605906] [2022-04-28 09:04:50,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952605906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565513165] [2022-04-28 09:04:50,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:04:50,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:50,960 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:04:50,965 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:04:51,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:04:51,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:51,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:04:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:51,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:52,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {8100#true} call ULTIMATE.init(); {8100#true} is VALID [2022-04-28 09:04:52,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {8100#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); {8100#true} is VALID [2022-04-28 09:04:52,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {8100#true} assume true; {8100#true} is VALID [2022-04-28 09:04:52,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8100#true} {8100#true} #94#return; {8100#true} is VALID [2022-04-28 09:04:52,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {8100#true} call #t~ret15 := main(); {8100#true} is VALID [2022-04-28 09:04:52,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {8100#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; {8105#(= main_~j~0 0)} is VALID [2022-04-28 09:04:52,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {8105#(= 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; {8105#(= main_~j~0 0)} is VALID [2022-04-28 09:04:52,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {8105#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8106#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:04:52,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {8106#(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; {8106#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:04:52,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {8106#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8107#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:04:52,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {8107#(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; {8107#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:04:52,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {8107#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {8150#(and (<= 3 main_~j~0) (<= main_~j~0 3))} is VALID [2022-04-28 09:04:52,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {8150#(and (<= 3 main_~j~0) (<= main_~j~0 3))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8109#(<= 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:04:52,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {8109#(<= 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; {8110#(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:04:52,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {8110#(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; {8110#(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:04:52,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {8110#(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; {8110#(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:04:52,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {8110#(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; {8110#(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:04:52,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {8110#(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; {8110#(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:04:52,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {8110#(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); {8110#(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:04:52,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {8110#(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; {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:04:52,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {8175#(and (<= 0 (div (+ 3 (* (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; {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:04:52,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} #t~short10 := ~i~0 >= 0; {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:04:52,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:04:52,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:04:52,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} is VALID [2022-04-28 09:04:52,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {8175#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~j~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8194#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~j~0) 2))} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {8194#(and (<= 0 (div (+ 3 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) 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; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {8101#false} #t~short10 := ~i~0 >= 0; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {8101#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; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {8101#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {8101#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {8101#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {8101#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {8101#false} ~k~0 := 1; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {8101#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); {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L272 TraceCheckUtils]: 35: Hoare triple {8101#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {8101#false} ~cond := #in~cond; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {8101#false} assume 0 == ~cond; {8101#false} is VALID [2022-04-28 09:04:52,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {8101#false} assume !false; {8101#false} is VALID [2022-04-28 09:04:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:04:52,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:06,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {8101#false} assume !false; {8101#false} is VALID [2022-04-28 09:05:06,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {8101#false} assume 0 == ~cond; {8101#false} is VALID [2022-04-28 09:05:06,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {8101#false} ~cond := #in~cond; {8101#false} is VALID [2022-04-28 09:05:06,341 INFO L272 TraceCheckUtils]: 35: Hoare triple {8101#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {8101#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); {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {8101#false} ~k~0 := 1; {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {8101#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {8101#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {8101#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {8101#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {8101#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; {8101#false} is VALID [2022-04-28 09:05:06,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {8101#false} #t~short10 := ~i~0 >= 0; {8101#false} is VALID [2022-04-28 09:05:06,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {8112#(<= (+ 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; {8101#false} is VALID [2022-04-28 09:05:06,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {8111#(<= 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; {8112#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 09:05:06,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {8111#(<= 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); {8111#(<= 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:05:06,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {8111#(<= 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; {8111#(<= 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:05:06,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {8111#(<= 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; {8111#(<= 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:05:06,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {8111#(<= 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; {8111#(<= 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:05:06,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {8111#(<= 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; {8111#(<= 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:05:06,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {8291#(<= 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; {8111#(<= 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:05:06,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {8291#(<= 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); {8291#(<= 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:05:06,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {8291#(<= 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; {8291#(<= 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:05:06,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {8291#(<= 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; {8291#(<= 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:05:06,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {8291#(<= 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; {8291#(<= 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:05:06,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {8291#(<= 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; {8291#(<= 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:05:06,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {8109#(<= 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; {8291#(<= 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:05:06,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {8313#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod main_~j~0 4294967296))) 4294967296) 1) 2))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {8109#(<= 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:05:06,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {8317#(<= 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; {8313#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod main_~j~0 4294967296))) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {8317#(<= 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; {8317#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {8324#(<= 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; {8317#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {8324#(<= 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; {8324#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {8331#(<= 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; {8324#(<= 0 (div (+ (div (+ (- 4294967293) (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {8331#(<= 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; {8331#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {8100#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; {8331#(<= 0 (div (+ (div (+ (* (- 1) (mod (+ main_~j~0 3) 4294967296)) (- 4294967293)) 4294967296) 1) 2))} is VALID [2022-04-28 09:05:06,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {8100#true} call #t~ret15 := main(); {8100#true} is VALID [2022-04-28 09:05:06,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8100#true} {8100#true} #94#return; {8100#true} is VALID [2022-04-28 09:05:06,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {8100#true} assume true; {8100#true} is VALID [2022-04-28 09:05:06,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {8100#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); {8100#true} is VALID [2022-04-28 09:05:06,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {8100#true} call ULTIMATE.init(); {8100#true} is VALID [2022-04-28 09:05:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:05:06,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565513165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:06,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:06,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 09:05:06,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706867009] [2022-04-28 09:05:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706867009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:06,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:06,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:05:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708084349] [2022-04-28 09:05:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:06,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:06,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:06,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:06,417 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:05:06,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:05:06,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:06,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:05:06,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:05:06,419 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:09,442 INFO L93 Difference]: Finished difference Result 292 states and 380 transitions. [2022-04-28 09:05:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:05:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2022-04-28 09:05:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2022-04-28 09:05:09,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 134 transitions. [2022-04-28 09:05:09,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:09,634 INFO L225 Difference]: With dead ends: 292 [2022-04-28 09:05:09,634 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 09:05:09,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:05:09,638 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 198 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:09,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 79 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 09:05:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 09:05:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 169. [2022-04-28 09:05:10,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:10,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 169 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 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:05:10,484 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 169 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 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:05:10,484 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 169 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 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:05:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:10,492 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2022-04-28 09:05:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 313 transitions. [2022-04-28 09:05:10,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:10,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:10,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 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 242 states. [2022-04-28 09:05:10,496 INFO L87 Difference]: Start difference. First operand has 169 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 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 242 states. [2022-04-28 09:05:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:10,501 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2022-04-28 09:05:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 313 transitions. [2022-04-28 09:05:10,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:10,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:10,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:10,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 162 states have internal predecessors, (209), 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:05:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2022-04-28 09:05:10,506 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 39 [2022-04-28 09:05:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:10,506 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 216 transitions. [2022-04-28 09:05:10,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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:05:10,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 216 transitions. [2022-04-28 09:05:11,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 216 transitions. [2022-04-28 09:05:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 09:05:11,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:11,019 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:05:11,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:11,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 09:05:11,220 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1844691523, now seen corresponding path program 3 times [2022-04-28 09:05:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:11,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [769502361] [2022-04-28 09:05:11,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:11,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1844691523, now seen corresponding path program 4 times [2022-04-28 09:05:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:11,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174207810] [2022-04-28 09:05:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:11,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {9800#(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); {9779#true} is VALID [2022-04-28 09:05:11,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:11,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9779#true} {9779#true} #94#return; {9779#true} is VALID [2022-04-28 09:05:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:05:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:11,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {9779#true} ~cond := #in~cond; {9779#true} is VALID [2022-04-28 09:05:11,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {9779#true} assume !(0 == ~cond); {9779#true} is VALID [2022-04-28 09:05:11,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:11,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9779#true} {9791#(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))))} #92#return; {9791#(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:05:11,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {9779#true} call ULTIMATE.init(); {9800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:11,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {9800#(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); {9779#true} is VALID [2022-04-28 09:05:11,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:11,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9779#true} {9779#true} #94#return; {9779#true} is VALID [2022-04-28 09:05:11,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {9779#true} call #t~ret15 := main(); {9779#true} is VALID [2022-04-28 09:05:11,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {9779#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; {9784#(= main_~j~0 0)} is VALID [2022-04-28 09:05:11,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {9784#(= 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; {9784#(= main_~j~0 0)} is VALID [2022-04-28 09:05:11,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {9784#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {9785#(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; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9786#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:05:11,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {9786#(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; {9786#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:05:11,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {9786#(and (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9779#true} is VALID [2022-04-28 09:05:11,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {9779#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9779#true} is VALID [2022-04-28 09:05:11,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {9779#true} ~j~0 := 1; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {9785#(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; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {9785#(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; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {9785#(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); {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:11,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9786#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:05:11,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {9786#(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; {9787#(= 4 (* main_~i~0 4))} is VALID [2022-04-28 09:05:11,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {9787#(= 4 (* main_~i~0 4))} #t~short10 := ~i~0 >= 0; {9787#(= 4 (* main_~i~0 4))} is VALID [2022-04-28 09:05:11,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {9787#(= 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; {9788#(and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 8)) (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:05:11,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {9788#(and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 8)) (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; {9789#(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:05:11,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {9789#(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); {9790#(<= (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:05:11,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {9790#(<= (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; {9790#(<= (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:05:11,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {9790#(<= (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); {9790#(<= (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:05:11,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {9790#(<= (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; {9791#(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:05:11,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {9791#(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); {9791#(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:05:11,516 INFO L272 TraceCheckUtils]: 29: Hoare triple {9791#(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)); {9779#true} is VALID [2022-04-28 09:05:11,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {9779#true} ~cond := #in~cond; {9779#true} is VALID [2022-04-28 09:05:11,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {9779#true} assume !(0 == ~cond); {9779#true} is VALID [2022-04-28 09:05:11,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:11,517 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9779#true} {9791#(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))))} #92#return; {9791#(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:05:11,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {9791#(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; {9791#(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:05:11,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {9791#(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; {9796#(<= (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:05:11,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {9796#(<= (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); {9797#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:05:11,519 INFO L272 TraceCheckUtils]: 37: Hoare triple {9797#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9798#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:05:11,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {9798#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9799#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:05:11,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {9799#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9780#false} is VALID [2022-04-28 09:05:11,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {9780#false} assume !false; {9780#false} is VALID [2022-04-28 09:05:11,520 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:05:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174207810] [2022-04-28 09:05:11,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174207810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873551443] [2022-04-28 09:05:11,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:05:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:11,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:11,524 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:05:11,528 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:05:11,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:05:11,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:11,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:05:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:11,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:11,727 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:05:11,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:11,968 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:05:12,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:12,270 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:05:12,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {9779#true} call ULTIMATE.init(); {9779#true} is VALID [2022-04-28 09:05:12,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {9779#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); {9779#true} is VALID [2022-04-28 09:05:12,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:12,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9779#true} {9779#true} #94#return; {9779#true} is VALID [2022-04-28 09:05:12,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {9779#true} call #t~ret15 := main(); {9779#true} is VALID [2022-04-28 09:05:12,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {9779#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; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {9819#(= |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; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {9819#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {9819#(= |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; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {9819#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {9819#(= |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; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {9819#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {9819#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9819#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:12,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {9819#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {9844#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} is VALID [2022-04-28 09:05:12,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {9844#(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; {9848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:05:12,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {9848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:05:12,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {9848#(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; {9848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:05:12,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {9848#(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; {9848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-28 09:05:12,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {9848#(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); {9844#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} is VALID [2022-04-28 09:05:12,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {9844#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9864#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2))} is VALID [2022-04-28 09:05:12,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {9864#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {9868#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)))} is VALID [2022-04-28 09:05:12,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {9868#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {9868#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)))} is VALID [2022-04-28 09:05:12,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {9868#(and (= |main_~#v~0.offset| 0) (= 2 (+ 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; {9875#(and (= |main_~#v~0.offset| 0) (= 2 (+ 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:05:12,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {9875#(and (= |main_~#v~0.offset| 0) (= 2 (+ 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; {9879#(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:05:12,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {9879#(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); {9883#(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:05:12,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {9883#(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; {9883#(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:05:12,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {9883#(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); {9883#(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:05:12,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {9883#(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; {9893#(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:05:12,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {9893#(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); {9893#(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:05:12,373 INFO L272 TraceCheckUtils]: 29: Hoare triple {9893#(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)); {9900#(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:05:12,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {9900#(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; {9900#(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:05:12,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {9900#(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); {9900#(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:05:12,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {9900#(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; {9900#(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:05:12,374 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9900#(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)))} {9893#(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))} #92#return; {9893#(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:05:12,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {9893#(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; {9893#(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:05:12,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {9893#(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; {9919#(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:05:12,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {9919#(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); {9797#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:05:12,376 INFO L272 TraceCheckUtils]: 37: Hoare triple {9797#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:05:12,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {9926#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:05:12,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {9930#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9780#false} is VALID [2022-04-28 09:05:12,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {9780#false} assume !false; {9780#false} is VALID [2022-04-28 09:05:12,377 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:05:12,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:13,483 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:05:13,555 INFO L356 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2022-04-28 09:05:13,556 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:05:14,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {9780#false} assume !false; {9780#false} is VALID [2022-04-28 09:05:14,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {9930#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9780#false} is VALID [2022-04-28 09:05:14,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {9926#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:05:14,955 INFO L272 TraceCheckUtils]: 37: Hoare triple {9797#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {9926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:05:14,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {9796#(<= (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); {9797#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:05:14,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {9952#(<= (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; {9796#(<= (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:05:14,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {9952#(<= (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; {9952#(<= (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:05:14,957 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {9779#true} {9952#(<= (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)))} #92#return; {9952#(<= (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:05:14,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:14,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {9779#true} assume !(0 == ~cond); {9779#true} is VALID [2022-04-28 09:05:14,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {9779#true} ~cond := #in~cond; {9779#true} is VALID [2022-04-28 09:05:14,958 INFO L272 TraceCheckUtils]: 29: Hoare triple {9952#(<= (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)); {9779#true} is VALID [2022-04-28 09:05:14,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {9952#(<= (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); {9952#(<= (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:05:14,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {9790#(<= (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; {9952#(<= (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:05:14,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {9790#(<= (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); {9790#(<= (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:05:14,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {9790#(<= (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; {9790#(<= (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:05:14,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#(forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_255))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {9790#(<= (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:05:14,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {9990#(or (forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_255)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9986#(forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_255))))} is VALID [2022-04-28 09:05:14,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {9994#(forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_255 (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; {9990#(or (forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (not (<= main_~key~0 v_ArrVal_255)))) |main_#t~short10|)} is VALID [2022-04-28 09:05:14,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#(forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_255 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} #t~short10 := ~i~0 >= 0; {9994#(forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_255 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-28 09:05:14,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {10001#(forall ((v_ArrVal_255 Int)) (or (< v_ArrVal_255 (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_255) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_255) (+ |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; {9994#(forall ((v_ArrVal_255 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_255) (+ |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_255) (+ |main_~#v~0.offset| 8))) (< v_ArrVal_255 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-28 09:05:14,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {10005#(forall ((v_ArrVal_255 Int)) (or (< v_ArrVal_255 (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_255) (+ |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_255) (+ |main_~#v~0.offset| 8)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {10001#(forall ((v_ArrVal_255 Int)) (or (< v_ArrVal_255 (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_255) (+ |main_~#v~0.offset| 4)) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_255) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-28 09:05:14,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {9785#(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); {10005#(forall ((v_ArrVal_255 Int)) (or (< v_ArrVal_255 (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_255) (+ |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_255) (+ |main_~#v~0.offset| 8)))))} is VALID [2022-04-28 09:05:14,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:14,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {9785#(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; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:14,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:14,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {9785#(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; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:14,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {9779#true} ~j~0 := 1; {9785#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:14,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {9779#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {9779#true} is VALID [2022-04-28 09:05:14,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {9779#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9779#true} is VALID [2022-04-28 09:05:14,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {9779#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; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {9779#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {9779#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; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {9779#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {9779#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; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {9779#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; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {9779#true} call #t~ret15 := main(); {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9779#true} {9779#true} #94#return; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {9779#true} assume true; {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {9779#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); {9779#true} is VALID [2022-04-28 09:05:14,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {9779#true} call ULTIMATE.init(); {9779#true} is VALID [2022-04-28 09:05:14,973 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:05:14,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873551443] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:14,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:14,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 34 [2022-04-28 09:05:14,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:14,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [769502361] [2022-04-28 09:05:14,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [769502361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:14,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:14,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:05:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722406842] [2022-04-28 09:05:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:14,975 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:05:14,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:14,975 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:05:15,013 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:05:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:05:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:05:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:05:15,014 INFO L87 Difference]: Start difference. First operand 169 states and 216 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:05:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:18,392 INFO L93 Difference]: Finished difference Result 245 states and 312 transitions. [2022-04-28 09:05:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:05:18,392 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:05:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:18,392 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:05:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 112 transitions. [2022-04-28 09:05:18,394 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:05:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 112 transitions. [2022-04-28 09:05:18,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 112 transitions. [2022-04-28 09:05:18,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:18,504 INFO L225 Difference]: With dead ends: 245 [2022-04-28 09:05:18,504 INFO L226 Difference]: Without dead ends: 243 [2022-04-28 09:05:18,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=286, Invalid=2264, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 09:05:18,505 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 137 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:18,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 85 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 09:05:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-04-28 09:05:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2022-04-28 09:05:19,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:19,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 191 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 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:05:19,438 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 191 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 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:05:19,438 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 191 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 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:05:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:19,443 INFO L93 Difference]: Finished difference Result 243 states and 310 transitions. [2022-04-28 09:05:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 310 transitions. [2022-04-28 09:05:19,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:19,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:19,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 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 243 states. [2022-04-28 09:05:19,445 INFO L87 Difference]: Start difference. First operand has 191 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 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 243 states. [2022-04-28 09:05:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:19,450 INFO L93 Difference]: Finished difference Result 243 states and 310 transitions. [2022-04-28 09:05:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 310 transitions. [2022-04-28 09:05:19,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:19,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:19,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:19,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 182 states have internal predecessors, (230), 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:05:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 241 transitions. [2022-04-28 09:05:19,455 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 241 transitions. Word has length 41 [2022-04-28 09:05:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:19,455 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 241 transitions. [2022-04-28 09:05:19,455 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:05:19,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 241 transitions. [2022-04-28 09:05:20,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-28 09:05:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 09:05:20,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:20,049 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] [2022-04-28 09:05:20,065 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:05:20,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 09:05:20,250 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1706177446, now seen corresponding path program 11 times [2022-04-28 09:05:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:20,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624332160] [2022-04-28 09:05:20,255 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:20,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1706177446, now seen corresponding path program 12 times [2022-04-28 09:05:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:20,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698760290] [2022-04-28 09:05:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:21,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {11482#(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); {11457#true} is VALID [2022-04-28 09:05:21,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {11457#true} assume true; {11457#true} is VALID [2022-04-28 09:05:21,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11457#true} {11457#true} #94#return; {11457#true} is VALID [2022-04-28 09:05:21,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {11457#true} call ULTIMATE.init(); {11482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:21,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {11482#(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); {11457#true} is VALID [2022-04-28 09:05:21,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {11457#true} assume true; {11457#true} is VALID [2022-04-28 09:05:21,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11457#true} {11457#true} #94#return; {11457#true} is VALID [2022-04-28 09:05:21,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {11457#true} call #t~ret15 := main(); {11457#true} is VALID [2022-04-28 09:05:21,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {11457#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; {11462#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:05:21,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {11462#(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; {11462#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 09:05:21,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {11462#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:21,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {11463#(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; {11463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:21,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {11463#(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; {11464#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} is VALID [2022-04-28 09:05:21,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {11464#(and (= |main_~#v~0.offset| 0) (<= (+ (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; {11464#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} is VALID [2022-04-28 09:05:21,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {11464#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11465#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-28 09:05:21,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {11465#(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; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:21,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {11466#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:21,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {11466#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:21,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {11466#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {11463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:21,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {11463#(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; {11467#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 09:05:21,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {11467#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {11468#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-28 09:05:21,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {11468#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11469#(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:05:21,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {11469#(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; {11470#(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:05:21,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {11470#(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); {11471#(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:05:21,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {11471#(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; {11472#(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:05:21,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {11472#(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; {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:05:21,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:05:21,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~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; {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:05:21,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 09:05:21,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {11473#(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)))) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~0) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11474#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:21,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {11474#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11475#(and (= |main_~#v~0.offset| 0) (<= 3 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:05:21,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {11475#(and (= |main_~#v~0.offset| 0) (<= 3 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; {11476#(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:05:21,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {11476#(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; {11476#(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:05:21,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {11476#(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; {11476#(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:05:21,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {11476#(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; {11476#(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:05:21,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {11476#(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); {11477#(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:05:21,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {11477#(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; {11477#(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:05:21,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {11477#(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); {11477#(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:05:21,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {11477#(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; {11478#(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:05:21,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {11478#(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); {11479#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:05:21,047 INFO L272 TraceCheckUtils]: 37: Hoare triple {11479#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11480#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:05:21,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {11480#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11481#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:05:21,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {11481#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11458#false} is VALID [2022-04-28 09:05:21,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {11458#false} assume !false; {11458#false} is VALID [2022-04-28 09:05:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:05:21,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:21,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698760290] [2022-04-28 09:05:21,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698760290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:21,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060258319] [2022-04-28 09:05:21,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:05:21,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:21,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:21,050 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:05:21,051 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:05:21,160 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:05:21,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:21,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 09:05:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:21,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:21,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,497 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:05:21,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:21,725 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:05:21,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 09:05:21,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:21,923 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:05:22,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:22,002 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:05:22,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {11457#true} call ULTIMATE.init(); {11457#true} is VALID [2022-04-28 09:05:22,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {11457#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); {11457#true} is VALID [2022-04-28 09:05:22,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {11457#true} assume true; {11457#true} is VALID [2022-04-28 09:05:22,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11457#true} {11457#true} #94#return; {11457#true} is VALID [2022-04-28 09:05:22,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {11457#true} call #t~ret15 := main(); {11457#true} is VALID [2022-04-28 09:05:22,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {11457#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; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {11466#(= |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; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {11466#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {11466#(= |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; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {11466#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {11466#(= |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; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {11466#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {11466#(= |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; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {11466#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {11466#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {11466#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 09:05:22,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {11466#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {11463#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:22,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {11463#(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; {11534#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:22,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {11534#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {11534#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:22,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {11534#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11469#(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:05:22,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {11469#(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; {11470#(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:05:22,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {11470#(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); {11471#(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:05:22,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {11471#(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; {11474#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:22,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {11474#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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; {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:22,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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))))} #t~short10 := ~i~0 >= 0; {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:22,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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 #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:22,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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 !#t~short10;havoc #t~mem9;havoc #t~short10; {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:22,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {11553#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 (+ main_~i~0 1)) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {11474#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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:05:22,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {11474#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 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))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11475#(and (= |main_~#v~0.offset| 0) (<= 3 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:05:22,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {11475#(and (= |main_~#v~0.offset| 0) (<= 3 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; {11572#(and (= |main_~#v~0.offset| 0) (<= 2 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:05:22,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {11572#(and (= |main_~#v~0.offset| 0) (<= 2 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; {11576#(and (= |main_~#v~0.offset| 0) (<= 2 main_~i~0) |main_#t~short10| (<= (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:05:22,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {11576#(and (= |main_~#v~0.offset| 0) (<= 2 main_~i~0) |main_#t~short10| (<= (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; {11572#(and (= |main_~#v~0.offset| 0) (<= 2 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:05:22,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {11572#(and (= |main_~#v~0.offset| 0) (<= 2 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; {11572#(and (= |main_~#v~0.offset| 0) (<= 2 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:05:22,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {11572#(and (= |main_~#v~0.offset| 0) (<= 2 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); {11477#(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:05:22,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {11477#(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; {11477#(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:05:22,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {11477#(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); {11477#(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:05:22,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {11477#(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; {11478#(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:05:22,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {11478#(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); {11479#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 09:05:22,103 INFO L272 TraceCheckUtils]: 37: Hoare triple {11479#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {11601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:05:22,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {11601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:05:22,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {11605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11458#false} is VALID [2022-04-28 09:05:22,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {11458#false} assume !false; {11458#false} is VALID [2022-04-28 09:05:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 09:05:22,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:48,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_37 Int)) (or (not (<= c_main_~j~0 (+ v_main_~i~0_37 1))) (forall ((v_main_~i~0_36 Int) (v_ArrVal_293 Int) (v_ArrVal_291 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| 4 (* v_main_~i~0_37 4)) v_ArrVal_291) (+ |c_main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_293))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4)))) (< v_main_~i~0_36 c_main_~j~0) (not (<= 0 v_main_~i~0_36)))))) is different from false [2022-04-28 09:06:00,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 Int) (v_main_~i~0_37 Int) (v_main_~i~0_36 Int) (v_ArrVal_293 Int) (v_ArrVal_291 Int)) (or (< v_main_~i~0_36 (+ c_main_~j~0 1)) (let ((.cse0 (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_289) (+ |c_main_~#v~0.offset| 4 (* v_main_~i~0_37 4)) v_ArrVal_291) (+ |c_main_~#v~0.offset| 4 (* v_main_~i~0_36 4)) v_ArrVal_293))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4)))) (not (<= c_main_~key~0 v_ArrVal_289)) (not (<= 0 v_main_~i~0_36)) (< v_main_~i~0_37 c_main_~j~0))) is different from false [2022-04-28 09:06:02,985 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 73 treesize of output 67 [2022-04-28 09:06:03,159 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 09:06:03,159 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 23217 treesize of output 22463