/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:46,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:46,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:46,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:46,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:46,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:46,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:46,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:46,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:46,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:46,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:46,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:46,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:46,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:46,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:46,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:46,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:46,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:46,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:46,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:46,490 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:46,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:46,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:46,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:46,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:46,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:46,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:46,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:46,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:46,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:46,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:46,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:46,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:46,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:46,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:46,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:46,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:46,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:46,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:46,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:46,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:46,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:46,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:46,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:46,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:46,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:46,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:46,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:46,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:46,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:46,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:46,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:46,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:46,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:46,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:46,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:46,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:46,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:46,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:46,512 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:41:46,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:46,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:46,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:46,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:46,719 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:46,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-15 05:41:46,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b335505/b72cf80e073f454ea58f1d3f53e6e982/FLAG0da37ff02 [2022-04-15 05:41:47,110 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:47,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-15 05:41:47,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b335505/b72cf80e073f454ea58f1d3f53e6e982/FLAG0da37ff02 [2022-04-15 05:41:47,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b335505/b72cf80e073f454ea58f1d3f53e6e982 [2022-04-15 05:41:47,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:47,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:47,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:47,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:47,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:47,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16003bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47, skipping insertion in model container [2022-04-15 05:41:47,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:47,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:47,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c[328,341] [2022-04-15 05:41:47,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:47,365 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:47,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c[328,341] [2022-04-15 05:41:47,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:47,409 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:47,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47 WrapperNode [2022-04-15 05:41:47,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:47,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:47,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:47,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:47,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:47,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:47,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:47,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:47,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (1/1) ... [2022-04-15 05:41:47,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:47,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:41:47,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:41:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:41:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:41:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:41:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:47,569 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:47,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:47,756 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:47,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:47,761 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 05:41:47,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:47 BoogieIcfgContainer [2022-04-15 05:41:47,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:47,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:47,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:47,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:47,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:47" (1/3) ... [2022-04-15 05:41:47,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6181676e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:47, skipping insertion in model container [2022-04-15 05:41:47,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:47" (2/3) ... [2022-04-15 05:41:47,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6181676e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:47, skipping insertion in model container [2022-04-15 05:41:47,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:47" (3/3) ... [2022-04-15 05:41:47,776 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2022-04-15 05:41:47,780 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:47,780 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:47,814 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:47,831 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:41:47,831 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:41:47,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:47,848 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:47,848 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:47,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 1 times [2022-04-15 05:41:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086502518] [2022-04-15 05:41:47,866 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 2 times [2022-04-15 05:41:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:47,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390643719] [2022-04-15 05:41:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 05:41:48,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 05:41:48,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-15 05:41:48,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:48,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 05:41:48,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 05:41:48,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-15 05:41:48,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret15 := main(); {34#true} is VALID [2022-04-15 05:41:48,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {34#true} is VALID [2022-04-15 05:41:48,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {34#true} is VALID [2022-04-15 05:41:48,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~j~0 := 1; {34#true} is VALID [2022-04-15 05:41:48,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-15 05:41:48,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~k~0 := 1; {35#false} is VALID [2022-04-15 05:41:48,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {35#false} is VALID [2022-04-15 05:41:48,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {35#false} is VALID [2022-04-15 05:41:48,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 05:41:48,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 05:41:48,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 05:41:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:48,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390643719] [2022-04-15 05:41:48,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390643719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:48,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:48,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:48,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:48,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2086502518] [2022-04-15 05:41:48,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2086502518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:48,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:48,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28163437] [2022-04-15 05:41:48,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:48,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:48,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:48,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:48,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:41:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:41:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:48,126 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,227 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-15 05:41:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:41:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 05:41:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 05:41:48,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-15 05:41:48,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:48,332 INFO L225 Difference]: With dead ends: 54 [2022-04-15 05:41:48,332 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:41:48,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:48,339 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:48,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:41:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 05:41:48,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:48,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,363 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,363 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,365 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 05:41:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 05:41:48,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:48,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:48,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-15 05:41:48,366 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-15 05:41:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,368 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 05:41:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 05:41:48,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:48,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:48,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:48,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-15 05:41:48,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2022-04-15 05:41:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:48,371 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-15 05:41:48,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:48,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-15 05:41:48,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 05:41:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:41:48,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:48,417 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:48,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:48,417 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 1 times [2022-04-15 05:41:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:48,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [266977746] [2022-04-15 05:41:48,418 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 2 times [2022-04-15 05:41:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962313128] [2022-04-15 05:41:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:48,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-04-15 05:41:48,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-15 05:41:48,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-15 05:41:48,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:48,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-04-15 05:41:48,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-15 05:41:48,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-15 05:41:48,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret15 := main(); {254#true} is VALID [2022-04-15 05:41:48,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {259#(= main_~j~0 0)} is VALID [2022-04-15 05:41:48,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:48,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:48,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:48,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-15 05:41:48,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {255#false} is VALID [2022-04-15 05:41:48,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {255#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {255#false} is VALID [2022-04-15 05:41:48,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-15 05:41:48,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-15 05:41:48,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-15 05:41:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:48,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:48,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962313128] [2022-04-15 05:41:48,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962313128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:48,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:48,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:48,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:48,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [266977746] [2022-04-15 05:41:48,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [266977746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:48,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:48,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739830778] [2022-04-15 05:41:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:48,550 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-15 05:41:48,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:48,551 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-15 05:41:48,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:48,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:41:48,565 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,768 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-15 05:41:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:48,768 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-15 05:41:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:48,769 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-15 05:41:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 05:41:48,772 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-15 05:41:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 05:41:48,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-15 05:41:48,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:48,826 INFO L225 Difference]: With dead ends: 49 [2022-04-15 05:41:48,826 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 05:41:48,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:41:48,827 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:48,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 05:41:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 05:41:48,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:48,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,832 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,833 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,834 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 05:41:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 05:41:48,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:48,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:48,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-04-15 05:41:48,835 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-04-15 05:41:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:48,836 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 05:41:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 05:41:48,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:48,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:48,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:48,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 05:41:48,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-15 05:41:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:48,838 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 05:41:48,838 INFO L479 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-15 05:41:48,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 05:41:48,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 05:41:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:41:48,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:48,864 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:48,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:48,864 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 1 times [2022-04-15 05:41:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:48,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243429133] [2022-04-15 05:41:48,884 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:48,884 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:48,884 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 2 times [2022-04-15 05:41:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253410391] [2022-04-15 05:41:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-04-15 05:41:49,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-15 05:41:49,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-15 05:41:49,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:49,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-04-15 05:41:49,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-15 05:41:49,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-15 05:41:49,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-15 05:41:49,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {486#(= main_~j~0 0)} is VALID [2022-04-15 05:41:49,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {487#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} is VALID [2022-04-15 05:41:49,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {488#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-15 05:41:49,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-15 05:41:49,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-15 05:41:49,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-15 05:41:49,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {490#(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-15 05:41:49,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {482#false} is VALID [2022-04-15 05:41:49,082 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-15 05:41:49,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-15 05:41:49,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-15 05:41:49,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-15 05:41:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253410391] [2022-04-15 05:41:49,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253410391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960137336] [2022-04-15 05:41:49,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:49,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:49,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:41:49,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:41:49,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:49,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:41:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:49,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:49,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-15 05:41:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-04-15 05:41:49,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-15 05:41:49,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-15 05:41:49,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-15 05:41:49,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {481#true} is VALID [2022-04-15 05:41:49,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {481#true} is VALID [2022-04-15 05:41:49,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {481#true} is VALID [2022-04-15 05:41:49,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {481#true} is VALID [2022-04-15 05:41:49,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~j~0 := 1; {522#(= main_~j~0 1)} is VALID [2022-04-15 05:41:49,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {522#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-15 05:41:49,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {490#(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-15 05:41:49,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {482#false} is VALID [2022-04-15 05:41:49,556 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-15 05:41:49,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-15 05:41:49,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-15 05:41:49,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-15 05:41:49,557 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-15 05:41:49,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:41:49,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960137336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:41:49,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 05:41:49,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:49,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243429133] [2022-04-15 05:41:49,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243429133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:49,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:49,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976648264] [2022-04-15 05:41:49,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:49,560 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-15 05:41:49,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:49,560 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-15 05:41:49,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:41:49,573 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,669 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-15 05:41:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:49,669 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-15 05:41:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:49,670 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-15 05:41:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 05:41:49,673 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-15 05:41:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 05:41:49,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 05:41:49,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,713 INFO L225 Difference]: With dead ends: 45 [2022-04-15 05:41:49,713 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:41:49,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:41:49,719 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:49,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:41:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-15 05:41:49,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:49,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,728 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,728 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,729 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 05:41:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 05:41:49,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 05:41:49,730 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 05:41:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:49,731 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 05:41:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 05:41:49,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:49,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:49,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:49,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 05:41:49,733 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-04-15 05:41:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:49,733 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 05:41:49,733 INFO L479 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-15 05:41:49,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 05:41:49,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 05:41:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:41:49,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:49,761 INFO L499 BasicCegarLoop]: 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-15 05:41:49,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:49,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:49,964 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 1 times [2022-04-15 05:41:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992637622] [2022-04-15 05:41:49,972 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:49,972 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:49,972 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 2 times [2022-04-15 05:41:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864764650] [2022-04-15 05:41:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(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); {759#true} is VALID [2022-04-15 05:41:50,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-15 05:41:50,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-15 05:41:50,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:50,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#(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); {759#true} is VALID [2022-04-15 05:41:50,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-15 05:41:50,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-15 05:41:50,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-15 05:41:50,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {764#(= main_~j~0 0)} is VALID [2022-04-15 05:41:50,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= 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; {764#(= main_~j~0 0)} is VALID [2022-04-15 05:41:50,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {765#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:50,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {767#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 05:41:50,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {760#false} is VALID [2022-04-15 05:41:50,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#false} #t~short10 := ~i~0 >= 0; {760#false} is VALID [2022-04-15 05:41:50,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#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; {760#false} is VALID [2022-04-15 05:41:50,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {760#false} is VALID [2022-04-15 05:41:50,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {760#false} is VALID [2022-04-15 05:41:50,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {760#false} is VALID [2022-04-15 05:41:50,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {760#false} is VALID [2022-04-15 05:41:50,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#false} ~k~0 := 1; {760#false} is VALID [2022-04-15 05:41:50,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {760#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); {760#false} is VALID [2022-04-15 05:41:50,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-15 05:41:50,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-15 05:41:50,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-15 05:41:50,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-15 05:41:50,100 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-15 05:41:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864764650] [2022-04-15 05:41:50,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864764650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109546630] [2022-04-15 05:41:50,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:50,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:50,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:50,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:50,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:41:50,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:50,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:50,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 05:41:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:50,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:50,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2022-04-15 05:41:50,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#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); {759#true} is VALID [2022-04-15 05:41:50,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-15 05:41:50,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-15 05:41:50,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-15 05:41:50,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {764#(= main_~j~0 0)} is VALID [2022-04-15 05:41:50,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= 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; {764#(= main_~j~0 0)} is VALID [2022-04-15 05:41:50,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {793#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-15 05:41:50,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= (+ (- 1) main_~j~0) 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(<= 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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(<= 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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#(<= 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); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {824#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 05:41:50,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#(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); {760#false} is VALID [2022-04-15 05:41:50,524 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-15 05:41:50,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-15 05:41:50,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-15 05:41:50,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-15 05:41:50,536 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-15 05:41:50,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:50,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-15 05:41:50,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-15 05:41:50,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-15 05:41:50,890 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-15 05:41:50,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {852#(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); {760#false} is VALID [2022-04-15 05:41:50,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {852#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 05:41:50,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#(<= 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); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(<= 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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(<= 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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:41:50,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {883#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} is VALID [2022-04-15 05:41:50,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {887#(<= 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; {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-15 05:41:50,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-15 05:41:50,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-15 05:41:50,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-15 05:41:50,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-15 05:41:50,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#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); {759#true} is VALID [2022-04-15 05:41:50,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2022-04-15 05:41:50,897 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-15 05:41:50,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109546630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:50,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:50,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:41:50,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:50,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992637622] [2022-04-15 05:41:50,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992637622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:50,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:50,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:41:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963872153] [2022-04-15 05:41:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:41:50,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:50,899 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-15 05:41:50,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:50,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:41:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:41:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:41:50,913 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,136 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-15 05:41:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:51,137 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-15 05:41:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:51,137 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-15 05:41:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-15 05:41:51,139 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-15 05:41:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-15 05:41:51,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-15 05:41:51,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:51,191 INFO L225 Difference]: With dead ends: 55 [2022-04-15 05:41:51,191 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 05:41:51,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:41:51,192 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:51,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 05:41:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-15 05:41:51,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:51,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:51,204 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:51,205 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,206 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-15 05:41:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-15 05:41:51,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:51,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:51,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-15 05:41:51,207 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-15 05:41:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:51,208 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-15 05:41:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-15 05:41:51,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:51,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:51,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:51,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-15 05:41:51,209 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-04-15 05:41:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:51,210 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-15 05:41:51,210 INFO L479 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-15 05:41:51,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-15 05:41:51,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 05:41:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:41:51,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:51,239 INFO L499 BasicCegarLoop]: 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-15 05:41:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:51,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 05:41:51,462 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 3 times [2022-04-15 05:41:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:51,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206124068] [2022-04-15 05:41:51,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:51,468 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:51,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 4 times [2022-04-15 05:41:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:51,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846775752] [2022-04-15 05:41:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:51,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:51,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(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); {1161#true} is VALID [2022-04-15 05:41:51,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-15 05:41:51,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-15 05:41:51,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:51,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(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); {1161#true} is VALID [2022-04-15 05:41:51,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-15 05:41:51,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-15 05:41:51,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-15 05:41:51,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:41:51,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(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; {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:41:51,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:51,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#(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; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:51,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#(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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:51,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:51,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:51,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(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; {1169#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-15 05:41:51,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {1170#(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-15 05:41:51,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {1170#(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; {1171#(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-15 05:41:51,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {1171#(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; {1172#(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-15 05:41:51,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(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); {1173#(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-15 05:41:51,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(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; {1174#(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-15 05:41:51,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(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); {1174#(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-15 05:41:51,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(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; {1175#(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-15 05:41:51,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#(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); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:41:51,935 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:41:51,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {1177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:41:51,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1162#false} is VALID [2022-04-15 05:41:51,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-15 05:41:51,937 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-15 05:41:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:51,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846775752] [2022-04-15 05:41:51,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846775752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:51,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001753838] [2022-04-15 05:41:51,938 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:51,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:51,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:51,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:51,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 05:41:51,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:51,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:51,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:41:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:52,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:52,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:41:52,306 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-15 05:41:52,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:41:52,429 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-15 05:41:52,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2022-04-15 05:41:52,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#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); {1161#true} is VALID [2022-04-15 05:41:52,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-15 05:41:52,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-15 05:41:52,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-15 05:41:52,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:52,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {1168#(= |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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:52,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1168#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:52,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(= |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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:52,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:52,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:52,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:52,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(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; {1219#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-15 05:41:52,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {1219#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1223#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-15 05:41:52,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(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; {1227#(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-15 05:41:52,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(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; {1231#(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-15 05:41:52,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(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); {1174#(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-15 05:41:52,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#(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; {1174#(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-15 05:41:52,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(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); {1174#(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-15 05:41:52,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(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; {1175#(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-15 05:41:52,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#(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); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:41:52,493 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:52,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:52,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1162#false} is VALID [2022-04-15 05:41:52,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-15 05:41:52,495 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-15 05:41:52,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:52,789 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-15 05:41:52,816 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-15 05:41:52,816 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-15 05:41:52,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-15 05:41:52,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1162#false} is VALID [2022-04-15 05:41:52,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:52,969 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:52,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#(<= (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); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:41:52,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {1277#(<= (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; {1273#(<= (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-15 05:41:52,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {1277#(<= (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); {1277#(<= (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-15 05:41:52,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {1277#(<= (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; {1277#(<= (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-15 05:41:52,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1277#(<= (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-15 05:41:52,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1291#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1287#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} is VALID [2022-04-15 05:41:52,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#(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; {1291#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} is VALID [2022-04-15 05:41:52,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {1299#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {1295#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:41:52,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1303#(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; {1299#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:41:52,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#true} ~j~0 := 1; {1303#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-15 05:41:52,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1161#true} is VALID [2022-04-15 05:41:52,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1161#true} is VALID [2022-04-15 05:41:52,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#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; {1161#true} is VALID [2022-04-15 05:41:52,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {1161#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; {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#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); {1161#true} is VALID [2022-04-15 05:41:52,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2022-04-15 05:41:52,988 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-15 05:41:52,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001753838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:52,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:52,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-15 05:41:52,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:52,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206124068] [2022-04-15 05:41:52,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206124068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:52,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:52,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:41:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881745692] [2022-04-15 05:41:52,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:52,989 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-15 05:41:52,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:52,989 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-15 05:41:53,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:53,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:41:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:53,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:41:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-04-15 05:41:53,013 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:54,300 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 05:41:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:41:54,300 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-15 05:41:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:54,301 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-15 05:41:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-15 05:41:54,302 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-15 05:41:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-15 05:41:54,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 79 transitions. [2022-04-15 05:41:54,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:54,385 INFO L225 Difference]: With dead ends: 65 [2022-04-15 05:41:54,385 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 05:41:54,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=1733, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:41:54,386 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:54,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 69 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:41:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 05:41:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-04-15 05:41:54,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:54,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:54,439 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:54,440 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:54,443 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-15 05:41:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 05:41:54,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:54,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:54,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 63 states. [2022-04-15 05:41:54,444 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 63 states. [2022-04-15 05:41:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:54,446 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-15 05:41:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 05:41:54,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:54,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:54,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:54,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-15 05:41:54,448 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 25 [2022-04-15 05:41:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:54,449 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-15 05:41:54,449 INFO L479 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-15 05:41:54,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-15 05:41:54,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 05:41:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:41:54,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:54,509 INFO L499 BasicCegarLoop]: 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-15 05:41:54,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:54,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:54,723 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 1 times [2022-04-15 05:41:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [341341401] [2022-04-15 05:41:54,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:54,729 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:54,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 2 times [2022-04-15 05:41:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:54,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335306229] [2022-04-15 05:41:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:54,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {1728#(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); {1720#true} is VALID [2022-04-15 05:41:54,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-15 05:41:54,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1720#true} {1720#true} #87#return; {1720#true} is VALID [2022-04-15 05:41:54,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {1720#true} call ULTIMATE.init(); {1728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:54,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#(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); {1720#true} is VALID [2022-04-15 05:41:54,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-15 05:41:54,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1720#true} {1720#true} #87#return; {1720#true} is VALID [2022-04-15 05:41:54,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {1720#true} call #t~ret15 := main(); {1720#true} is VALID [2022-04-15 05:41:54,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {1720#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1720#true} is VALID [2022-04-15 05:41:54,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {1720#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; {1720#true} is VALID [2022-04-15 05:41:54,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {1720#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1720#true} is VALID [2022-04-15 05:41:54,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#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; {1720#true} is VALID [2022-04-15 05:41:54,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1720#true} is VALID [2022-04-15 05:41:54,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {1720#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1720#true} is VALID [2022-04-15 05:41:54,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#true} ~j~0 := 1; {1725#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-15 05:41:54,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {1725#(= (+ (- 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; {1726#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-15 05:41:54,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {1726#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {1727#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} is VALID [2022-04-15 05:41:54,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {1727#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} assume !#t~short10; {1721#false} is VALID [2022-04-15 05:41:54,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {1721#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1721#false} is VALID [2022-04-15 05:41:54,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1721#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1721#false} is VALID [2022-04-15 05:41:54,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1721#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1721#false} is VALID [2022-04-15 05:41:54,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {1721#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1721#false} is VALID [2022-04-15 05:41:54,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1721#false} ~k~0 := 1; {1721#false} is VALID [2022-04-15 05:41:54,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {1721#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); {1721#false} is VALID [2022-04-15 05:41:54,809 INFO L272 TraceCheckUtils]: 21: Hoare triple {1721#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1721#false} is VALID [2022-04-15 05:41:54,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {1721#false} ~cond := #in~cond; {1721#false} is VALID [2022-04-15 05:41:54,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {1721#false} assume 0 == ~cond; {1721#false} is VALID [2022-04-15 05:41:54,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {1721#false} assume !false; {1721#false} is VALID [2022-04-15 05:41:54,809 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-15 05:41:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:54,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335306229] [2022-04-15 05:41:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335306229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:54,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:54,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:54,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [341341401] [2022-04-15 05:41:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [341341401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:54,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:54,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055838105] [2022-04-15 05:41:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:54,811 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-15 05:41:54,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:54,811 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-15 05:41:54,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:54,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:54,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:41:54,827 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,029 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-15 05:41:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:41:55,030 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-15 05:41:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:55,030 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-15 05:41:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-15 05:41:55,035 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-15 05:41:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-15 05:41:55,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-15 05:41:55,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:55,082 INFO L225 Difference]: With dead ends: 82 [2022-04-15 05:41:55,082 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 05:41:55,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:41:55,083 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:55,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 30 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 05:41:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-15 05:41:55,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:55,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,137 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,137 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,141 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-15 05:41:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-15 05:41:55,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-15 05:41:55,142 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-15 05:41:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,144 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-15 05:41:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-15 05:41:55,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:55,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-15 05:41:55,146 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-15 05:41:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:55,146 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-15 05:41:55,146 INFO L479 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-15 05:41:55,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-15 05:41:55,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-15 05:41:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:41:55,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:55,201 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:55,201 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 05:41:55,202 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 1 times [2022-04-15 05:41:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485482958] [2022-04-15 05:41:55,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:55,206 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:55,206 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 2 times [2022-04-15 05:41:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:55,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612379509] [2022-04-15 05:41:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {2114#(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); {2095#true} is VALID [2022-04-15 05:41:55,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-15 05:41:55,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-15 05:41:55,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:55,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#(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); {2095#true} is VALID [2022-04-15 05:41:55,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-15 05:41:55,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-15 05:41:55,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-15 05:41:55,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:41:55,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#(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; {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:41:55,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:55,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {2101#(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; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:55,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {2101#(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; {2102#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:55,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2102#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:41:55,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:41:55,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {2101#(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; {2103#(and (= |main_~#v~0.offset| 0) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (and (<= (+ main_~i~0 1) 0) (= (+ (- 1) main_~j~0) 0))))} is VALID [2022-04-15 05:41:55,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {2103#(and (= |main_~#v~0.offset| 0) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (and (<= (+ main_~i~0 1) 0) (= (+ (- 1) main_~j~0) 0))))} #t~short10 := ~i~0 >= 0; {2104#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:41:55,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2105#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:41:55,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {2106#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-15 05:41:55,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {2106#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2107#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} is VALID [2022-04-15 05:41:55,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} assume !#t~short10; {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-15 05:41:55,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-15 05:41:55,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2109#(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-15 05:41:55,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {2109#(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; {2109#(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-15 05:41:55,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {2109#(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); {2109#(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-15 05:41:55,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {2109#(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; {2110#(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-15 05:41:55,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {2110#(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); {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-15 05:41:55,578 INFO L272 TraceCheckUtils]: 24: Hoare triple {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:41:55,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2113#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:41:55,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {2113#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2096#false} is VALID [2022-04-15 05:41:55,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-15 05:41:55,579 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-15 05:41:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612379509] [2022-04-15 05:41:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612379509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590448599] [2022-04-15 05:41:55,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:55,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:55,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:55,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:55,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 05:41:55,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:55,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:55,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:41:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:55,834 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 05:41:55,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-04-15 05:41:56,108 INFO L356 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-04-15 05:41:56,110 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-15 05:41:56,518 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-15 05:41:56,518 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-15 05:41:56,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-15 05:41:56,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#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); {2095#true} is VALID [2022-04-15 05:41:56,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#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; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#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; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-15 05:41:56,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2095#true} is VALID [2022-04-15 05:41:56,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#true} ~j~0 := 1; {2151#(= main_~j~0 1)} is VALID [2022-04-15 05:41:56,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {2151#(= 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; {2155#(= (+ main_~i~0 1) 1)} is VALID [2022-04-15 05:41:56,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#(= (+ main_~i~0 1) 1)} #t~short10 := ~i~0 >= 0; {2159#(and |main_#t~short10| (= (+ main_~i~0 1) 1))} is VALID [2022-04-15 05:41:56,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {2159#(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; {2163#(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-15 05:41:56,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {2163#(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;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {2167#(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-15 05:41:56,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {2167#(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; {2171#(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-15 05:41:56,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(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; {2175#(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-15 05:41:56,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {2175#(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; {2175#(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-15 05:41:56,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {2175#(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); {2182#(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-15 05:41:56,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {2182#(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; {2182#(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-15 05:41:56,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {2182#(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); {2182#(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-15 05:41:56,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {2182#(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; {2192#(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-15 05:41:56,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {2192#(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); {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-15 05:41:56,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:56,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:56,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-15 05:41:56,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-15 05:41:56,634 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-15 05:41:56,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:57,724 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-15 05:41:57,793 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-15 05:41:57,793 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 383 treesize of output 347 [2022-04-15 05:41:58,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-15 05:41:58,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-15 05:41:58,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:41:58,862 INFO L272 TraceCheckUtils]: 24: Hoare triple {2219#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:41:58,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {2223#(<= (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); {2219#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:41:58,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {2227#(<= (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; {2223#(<= (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-15 05:41:58,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(<= (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); {2227#(<= (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-15 05:41:58,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(<= (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; {2227#(<= (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-15 05:41:58,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2227#(<= (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-15 05:41:58,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-15 05:41:58,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-15 05:41:58,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {2248#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} #t~short10 := ~i~0 >= 0; {2244#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-15 05:41:58,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {2252#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {2248#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-15 05:41:58,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#(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; {2252#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} is VALID [2022-04-15 05:41:58,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {2095#true} #t~short10 := ~i~0 >= 0; {2256#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {2095#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; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#true} ~j~0 := 1; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#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; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#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; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-15 05:41:58,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-15 05:41:58,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#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); {2095#true} is VALID [2022-04-15 05:41:58,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-15 05:41:58,870 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-15 05:41:58,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590448599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:58,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:58,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 12] total 36 [2022-04-15 05:41:58,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:58,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485482958] [2022-04-15 05:41:58,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485482958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:58,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:58,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:41:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666344366] [2022-04-15 05:41:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:58,871 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:41:58,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:58,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:58,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:58,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:41:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:41:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1123, Unknown=1, NotChecked=0, Total=1260 [2022-04-15 05:41:58,945 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,619 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2022-04-15 05:42:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:42:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:42:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-15 05:42:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-15 05:42:00,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 103 transitions. [2022-04-15 05:42:00,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,721 INFO L225 Difference]: With dead ends: 104 [2022-04-15 05:42:00,721 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 05:42:00,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=338, Invalid=2417, Unknown=1, NotChecked=0, Total=2756 [2022-04-15 05:42:00,723 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:00,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 05:42:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 05:42:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-04-15 05:42:00,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:00,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:00,811 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:00,811 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,813 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-15 05:42:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-15 05:42:00,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-04-15 05:42:00,814 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-04-15 05:42:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,815 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-15 05:42:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-15 05:42:00,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:00,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-15 05:42:00,817 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 28 [2022-04-15 05:42:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:00,817 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-15 05:42:00,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:00,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-15 05:42:00,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-15 05:42:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 05:42:00,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:00,874 INFO L499 BasicCegarLoop]: 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-15 05:42:00,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:01,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,093 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 5 times [2022-04-15 05:42:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:01,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459187279] [2022-04-15 05:42:01,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:01,101 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:01,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 6 times [2022-04-15 05:42:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:01,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175445769] [2022-04-15 05:42:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {2792#(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); {2781#true} is VALID [2022-04-15 05:42:01,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-15 05:42:01,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-15 05:42:01,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:01,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#(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); {2781#true} is VALID [2022-04-15 05:42:01,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-15 05:42:01,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-15 05:42:01,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-15 05:42:01,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2786#(= main_~j~0 0)} is VALID [2022-04-15 05:42:01,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(= 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; {2786#(= main_~j~0 0)} is VALID [2022-04-15 05:42:01,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:01,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {2787#(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; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:01,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2788#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:01,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {2788#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:01,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(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); {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(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; {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= (+ 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; {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#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; {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#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); {2782#false} is VALID [2022-04-15 05:42:01,252 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-15 05:42:01,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-15 05:42:01,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-15 05:42:01,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-15 05:42:01,254 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-15 05:42:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175445769] [2022-04-15 05:42:01,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175445769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:01,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097725886] [2022-04-15 05:42:01,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:01,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:01,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:42:01,305 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:42:01,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:01,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:42:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:01,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2781#true} is VALID [2022-04-15 05:42:01,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#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); {2781#true} is VALID [2022-04-15 05:42:01,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-15 05:42:01,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-15 05:42:01,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-15 05:42:01,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2786#(= main_~j~0 0)} is VALID [2022-04-15 05:42:01,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(= 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; {2786#(= main_~j~0 0)} is VALID [2022-04-15 05:42:01,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:01,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {2787#(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; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:01,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-15 05:42:01,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:01,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(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); {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(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; {2848#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:01,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {2848#(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; {2782#false} is VALID [2022-04-15 05:42:01,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-15 05:42:01,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#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; {2782#false} is VALID [2022-04-15 05:42:01,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-15 05:42:01,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#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); {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-15 05:42:01,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-15 05:42:01,785 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-15 05:42:01,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:02,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#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); {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-15 05:42:02,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-15 05:42:02,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-15 05:42:02,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#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; {2782#false} is VALID [2022-04-15 05:42:02,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-15 05:42:02,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= (+ 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; {2782#false} is VALID [2022-04-15 05:42:02,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {2927#(<= (+ 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; {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:02,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {2927#(<= (+ 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); {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:42:02,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:42:02,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:42:02,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:42:02,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:42:02,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 05:42:02,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {2949#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:02,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2949#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-15 05:42:02,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(<= 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; {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-15 05:42:02,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-15 05:42:02,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#(<= 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; {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-15 05:42:02,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-15 05:42:02,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-15 05:42:02,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-15 05:42:02,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-15 05:42:02,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#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); {2781#true} is VALID [2022-04-15 05:42:02,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2781#true} is VALID [2022-04-15 05:42:02,140 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-15 05:42:02,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097725886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:02,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:02,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-15 05:42:02,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:02,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459187279] [2022-04-15 05:42:02,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459187279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:02,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:02,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196621317] [2022-04-15 05:42:02,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:02,141 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-15 05:42:02,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:02,141 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-15 05:42:02,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:02,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:02,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:02,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:42:02,165 INFO L87 Difference]: Start difference. First operand 46 states and 52 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-15 05:42:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:02,786 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-04-15 05:42:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:42:02,787 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-15 05:42:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:02,787 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-15 05:42:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-15 05:42:02,788 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-15 05:42:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-15 05:42:02,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2022-04-15 05:42:02,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:02,862 INFO L225 Difference]: With dead ends: 86 [2022-04-15 05:42:02,862 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 05:42:02,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:42:02,863 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 118 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:02,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 44 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 05:42:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-04-15 05:42:03,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:03,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:03,016 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:03,017 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,019 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 05:42:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-15 05:42:03,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-15 05:42:03,025 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-15 05:42:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,027 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 05:42:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-15 05:42:03,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:03,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-04-15 05:42:03,029 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 31 [2022-04-15 05:42:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:03,029 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-04-15 05:42:03,029 INFO L479 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-15 05:42:03,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 67 transitions. [2022-04-15 05:42:03,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-15 05:42:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 05:42:03,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:03,114 INFO L499 BasicCegarLoop]: 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-15 05:42:03,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:03,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:03,323 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 1 times [2022-04-15 05:42:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:03,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1267700469] [2022-04-15 05:42:03,327 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:03,328 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:03,328 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 2 times [2022-04-15 05:42:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:03,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827315605] [2022-04-15 05:42:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#(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); {3424#true} is VALID [2022-04-15 05:42:03,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:03,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-15 05:42:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 05:42:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-15 05:42:03,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-15 05:42:03,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:03,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:03,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#(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); {3424#true} is VALID [2022-04-15 05:42:03,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:03,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-15 05:42:03,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-15 05:42:03,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3429#(= main_~j~0 0)} is VALID [2022-04-15 05:42:03,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(= 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; {3429#(= main_~j~0 0)} is VALID [2022-04-15 05:42:03,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:03,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(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; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:03,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3431#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:42:03,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {3431#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= 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); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:03,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,470 INFO L272 TraceCheckUtils]: 21: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-15 05:42:03,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-15 05:42:03,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-15 05:42:03,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:03,471 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3438#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:03,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {3438#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3425#false} is VALID [2022-04-15 05:42:03,473 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-15 05:42:03,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-15 05:42:03,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-15 05:42:03,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-15 05:42:03,473 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-15 05:42:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:03,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827315605] [2022-04-15 05:42:03,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827315605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231495997] [2022-04-15 05:42:03,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:03,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:03,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:03,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:03,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:42:03,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:03,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:03,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:42:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:04,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3424#true} is VALID [2022-04-15 05:42:04,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#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); {3424#true} is VALID [2022-04-15 05:42:04,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:04,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-15 05:42:04,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-15 05:42:04,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3429#(= main_~j~0 0)} is VALID [2022-04-15 05:42:04,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(= 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; {3429#(= main_~j~0 0)} is VALID [2022-04-15 05:42:04,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:04,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(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; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:04,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3470#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-15 05:42:04,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {3470#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= 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); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:04,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:04,050 INFO L272 TraceCheckUtils]: 21: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-15 05:42:04,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-15 05:42:04,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-15 05:42:04,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:04,051 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:04,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:04,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3525#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 05:42:04,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {3525#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3425#false} is VALID [2022-04-15 05:42:04,053 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-15 05:42:04,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-15 05:42:04,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-15 05:42:04,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-15 05:42:04,053 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-15 05:42:04,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:04,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-15 05:42:04,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-15 05:42:04,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-15 05:42:04,467 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-15 05:42:04,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {3553#(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); {3425#false} is VALID [2022-04-15 05:42:04,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3553#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 05:42:04,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} havoc #t~mem13;havoc #t~mem14; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 05:42:04,469 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #85#return; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 05:42:04,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:04,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-15 05:42:04,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-15 05:42:04,470 INFO L272 TraceCheckUtils]: 21: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-15 05:42:04,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 05:42:04,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 05:42:04,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= 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); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {3609#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-15 05:42:04,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3609#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-15 05:42:04,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {3613#(<= 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; {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-15 05:42:04,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-15 05:42:04,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {3620#(<= 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; {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-15 05:42:04,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-15 05:42:04,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-15 05:42:04,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-15 05:42:04,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-15 05:42:04,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#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); {3424#true} is VALID [2022-04-15 05:42:04,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3424#true} is VALID [2022-04-15 05:42:04,479 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-15 05:42:04,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231495997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:04,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:04,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 05:42:04,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:04,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1267700469] [2022-04-15 05:42:04,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1267700469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:04,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:04,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52010174] [2022-04-15 05:42:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:04,480 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-15 05:42:04,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:04,480 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-15 05:42:04,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:04,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:42:04,510 INFO L87 Difference]: Start difference. First operand 59 states and 67 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-15 05:42:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,094 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-04-15 05:42:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:42:05,095 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-15 05:42:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:05,095 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-15 05:42:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-15 05:42:05,096 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-15 05:42:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-15 05:42:05,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-15 05:42:05,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:05,167 INFO L225 Difference]: With dead ends: 78 [2022-04-15 05:42:05,167 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 05:42:05,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:42:05,168 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 103 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:05,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 05:42:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-15 05:42:05,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:05,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-15 05:42:05,255 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-15 05:42:05,255 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-15 05:42:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,256 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-15 05:42:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-15 05:42:05,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:05,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:05,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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 47 states. [2022-04-15 05:42:05,257 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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 47 states. [2022-04-15 05:42:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,258 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-15 05:42:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-15 05:42:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:05,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:05,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:05,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-15 05:42:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-15 05:42:05,260 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2022-04-15 05:42:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:05,260 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-15 05:42:05,260 INFO L479 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-15 05:42:05,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-15 05:42:05,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 05:42:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 05:42:05,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:05,332 INFO L499 BasicCegarLoop]: 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-15 05:42:05,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:05,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:05,535 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 7 times [2022-04-15 05:42:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:05,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837972084] [2022-04-15 05:42:05,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:05,543 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:05,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 8 times [2022-04-15 05:42:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:05,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504435432] [2022-04-15 05:42:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:06,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {4011#(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); {3990#true} is VALID [2022-04-15 05:42:06,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 05:42:06,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-15 05:42:06,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {4011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:06,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {4011#(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); {3990#true} is VALID [2022-04-15 05:42:06,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 05:42:06,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-15 05:42:06,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-15 05:42:06,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:42:06,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {3995#(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; {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:42:06,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:06,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {3996#(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; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:06,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {3996#(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; {3997#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-15 05:42:06,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {3997#(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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:06,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(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; {3999#(and (or (<= (+ main_~i~0 1) 0) (and (= |main_~#v~0.offset| 0) (<= (+ main_~i~0 1) main_~j~0))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-15 05:42:06,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {3999#(and (or (<= (+ main_~i~0 1) 0) (and (= |main_~#v~0.offset| 0) (<= (+ main_~i~0 1) main_~j~0))) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {4000#(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-15 05:42:06,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {4000#(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; {4001#(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-15 05:42:06,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {4001#(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; {4002#(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-15 05:42:06,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(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); {4003#(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-15 05:42:06,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {4003#(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; {4004#(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-15 05:42:06,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {4004#(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; {4005#(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-15 05:42:06,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {4005#(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; {4005#(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-15 05:42:06,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {4005#(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; {4005#(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-15 05:42:06,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {4005#(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; {4005#(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-15 05:42:06,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {4005#(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); {4006#(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-15 05:42:06,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {4006#(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; {4006#(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-15 05:42:06,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {4006#(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); {4006#(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-15 05:42:06,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {4006#(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; {4007#(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-15 05:42:06,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {4007#(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); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:42:06,051 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:06,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4010#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:06,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {4010#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3991#false} is VALID [2022-04-15 05:42:06,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-15 05:42:06,052 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-15 05:42:06,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:06,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504435432] [2022-04-15 05:42:06,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504435432] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:06,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735518518] [2022-04-15 05:42:06,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:06,054 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:06,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:42:06,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:06,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:06,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:42:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:06,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:06,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:06,448 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-15 05:42:06,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:06,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:06,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:06,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:06,615 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-15 05:42:06,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:06,679 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-15 05:42:06,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-15 05:42:06,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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); {3990#true} is VALID [2022-04-15 05:42:06,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 05:42:06,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-15 05:42:06,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-15 05:42:06,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {3998#(= |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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {3998#(= |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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {3998#(= |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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:06,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:06,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(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; {4057#(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-15 05:42:06,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {4057#(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; {4061#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |main_#t~short10|)} is VALID [2022-04-15 05:42:06,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {4061#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |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; {4001#(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-15 05:42:06,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {4001#(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; {4002#(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-15 05:42:06,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(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); {4003#(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-15 05:42:06,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {4003#(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; {4004#(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-15 05:42:06,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {4004#(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; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:06,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:06,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:06,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:06,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4006#(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-15 05:42:06,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {4006#(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; {4006#(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-15 05:42:06,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {4006#(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); {4006#(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-15 05:42:06,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {4006#(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; {4007#(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-15 05:42:06,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {4007#(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); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:42:06,760 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:06,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:06,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-15 05:42:06,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-15 05:42:06,761 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-15 05:42:06,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:09,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_18 Int)) (or (not (<= c_main_~j~0 (+ v_main_~i~0_18 1))) (forall ((v_ArrVal_137 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |c_main_~#v~0.offset| 4) v_ArrVal_137))) (<= (select .cse0 |c_main_~#v~0.offset|) (select .cse0 (+ |c_main_~#v~0.offset| 4))))))) is different from false [2022-04-15 05:42:14,679 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-15 05:42:14,740 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-15 05:42:14,741 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 1429 treesize of output 1347 [2022-04-15 05:42:22,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-15 05:42:22,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-15 05:42:22,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:22,194 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:22,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {4128#(<= (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); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:42:22,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {4132#(<= (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; {4128#(<= (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-15 05:42:22,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {4132#(<= (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); {4132#(<= (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-15 05:42:22,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {4132#(<= (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; {4132#(<= (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-15 05:42:22,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4132#(<= (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-15 05:42:22,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:22,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:22,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:22,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {4155#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 1)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:22,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {4159#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4155#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 1)))))} is VALID [2022-04-15 05:42:22,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {4163#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4159#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-15 05:42:22,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {4167#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4163#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-15 05:42:22,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {4171#(or (not |main_#t~short10|) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4167#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} is VALID [2022-04-15 05:42:22,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {4175#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4171#(or (not |main_#t~short10|) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-15 05:42:22,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {4179#(or (not (<= 1 main_~j~0)) (= (* 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; {4175#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3990#true} ~j~0 := 1; {4179#(or (not (<= 1 main_~j~0)) (= (* main_~j~0 4) 4))} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3990#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#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; {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {3990#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; {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {3990#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; {3990#true} is VALID [2022-04-15 05:42:22,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3990#true} is VALID [2022-04-15 05:42:22,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-15 05:42:22,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-15 05:42:22,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 05:42:22,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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); {3990#true} is VALID [2022-04-15 05:42:22,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-15 05:42:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-04-15 05:42:22,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735518518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:22,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:22,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 34 [2022-04-15 05:42:22,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:22,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837972084] [2022-04-15 05:42:22,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837972084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:22,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:22,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:42:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703667461] [2022-04-15 05:42:22,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:22,207 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-15 05:42:22,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:22,208 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-15 05:42:22,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:22,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:42:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:42:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=903, Unknown=11, NotChecked=62, Total=1122 [2022-04-15 05:42:22,244 INFO L87 Difference]: Start difference. First operand 41 states and 46 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-15 05:42:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,385 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-15 05:42:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 05:42:24,386 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-15 05:42:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:24,386 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-15 05:42:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 139 transitions. [2022-04-15 05:42:24,388 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-15 05:42:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 139 transitions. [2022-04-15 05:42:24,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 139 transitions. [2022-04-15 05:42:24,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:24,522 INFO L225 Difference]: With dead ends: 118 [2022-04-15 05:42:24,522 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 05:42:24,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=516, Invalid=2783, Unknown=11, NotChecked=112, Total=3422 [2022-04-15 05:42:24,523 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 162 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:24,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 61 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 05:42:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 05:42:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2022-04-15 05:42:24,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:24,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-15 05:42:24,698 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-15 05:42:24,699 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-15 05:42:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,701 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-04-15 05:42:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-04-15 05:42:24,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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 101 states. [2022-04-15 05:42:24,702 INFO L87 Difference]: Start difference. First operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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 101 states. [2022-04-15 05:42:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:24,704 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-04-15 05:42:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-04-15 05:42:24,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:24,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:24,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:24,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-15 05:42:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-04-15 05:42:24,706 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 33 [2022-04-15 05:42:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:24,706 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-04-15 05:42:24,706 INFO L479 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-15 05:42:24,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 77 transitions. [2022-04-15 05:42:24,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-04-15 05:42:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:42:24,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:24,829 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:24,846 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-15 05:42:25,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:25,044 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 1 times [2022-04-15 05:42:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:25,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543129344] [2022-04-15 05:42:25,049 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:25,049 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:25,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 2 times [2022-04-15 05:42:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882793818] [2022-04-15 05:42:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:25,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {4860#(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); {4842#true} is VALID [2022-04-15 05:42:25,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-15 05:42:25,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-15 05:42:25,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:25,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {4860#(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); {4842#true} is VALID [2022-04-15 05:42:25,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-15 05:42:25,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-15 05:42:25,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-15 05:42:25,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:42:25,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {4847#(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; {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:42:25,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {4848#(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; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {4849#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {4848#(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; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {4848#(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; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {4848#(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); {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {4848#(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; {4850#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-15 05:42:25,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {4850#(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; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:25,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:25,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {4851#(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; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:25,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:25,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:25,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {4852#(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; {4853#(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-15 05:42:25,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#(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; {4854#(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-15 05:42:25,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {4854#(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); {4855#(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-15 05:42:25,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {4855#(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; {4855#(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-15 05:42:25,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {4855#(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); {4855#(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-15 05:42:25,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {4855#(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; {4856#(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-15 05:42:25,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {4856#(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); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:42:25,362 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4858#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:25,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {4858#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4859#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:25,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {4859#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4843#false} is VALID [2022-04-15 05:42:25,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-15 05:42:25,363 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-15 05:42:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:25,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882793818] [2022-04-15 05:42:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882793818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513769737] [2022-04-15 05:42:25,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:25,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:25,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:25,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:42:25,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:25,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:25,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:42:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:25,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:25,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:25,771 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-15 05:42:25,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:25,871 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-15 05:42:25,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4842#true} is VALID [2022-04-15 05:42:25,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#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); {4842#true} is VALID [2022-04-15 05:42:25,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-15 05:42:25,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-15 05:42:25,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-15 05:42:25,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:25,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {4849#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {4903#(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; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {4903#(and (= |main_~#v~0.offset| 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; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:25,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4922#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-15 05:42:25,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {4922#(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; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-15 05:42:25,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-15 05:42:25,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-15 05:42:25,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {4936#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2022-04-15 05:42:25,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {4936#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short10 := ~i~0 >= 0; {4940#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-15 05:42:25,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {4940#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4853#(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-15 05:42:25,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#(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; {4854#(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-15 05:42:25,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {4854#(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); {4855#(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-15 05:42:25,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {4855#(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; {4855#(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-15 05:42:25,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {4855#(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); {4855#(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-15 05:42:25,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {4855#(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; {4856#(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-15 05:42:25,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {4856#(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); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:42:25,941 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:25,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:25,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {4969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4843#false} is VALID [2022-04-15 05:42:25,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-15 05:42:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:42:25,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:26,243 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-15 05:42:26,269 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-15 05:42:26,270 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-15 05:42:26,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-15 05:42:26,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {4969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4843#false} is VALID [2022-04-15 05:42:26,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:26,551 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:26,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {4988#(<= (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); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-15 05:42:26,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {4992#(<= (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; {4988#(<= (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-15 05:42:26,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {4992#(<= (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); {4992#(<= (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-15 05:42:26,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {4992#(<= (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; {4992#(<= (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-15 05:42:26,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {5002#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4992#(<= (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-15 05:42:26,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {5006#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5002#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-15 05:42:26,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {5010#(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; {5006#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-15 05:42:26,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {5014#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5010#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:26,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {5018#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {5014#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-15 05:42:26,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {5018#(<= 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; {5018#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:26,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {5018#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {5018#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:26,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {5028#(<= 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; {5018#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:26,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {5032#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5028#(<= main_~j~0 2)} is VALID [2022-04-15 05:42:26,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {5032#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5032#(<= main_~j~0 1)} is VALID [2022-04-15 05:42:26,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {5032#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5032#(<= main_~j~0 1)} is VALID [2022-04-15 05:42:26,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {5032#(<= 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; {5032#(<= main_~j~0 1)} is VALID [2022-04-15 05:42:26,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {5032#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {5032#(<= main_~j~0 1)} is VALID [2022-04-15 05:42:26,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {5032#(<= 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; {5032#(<= main_~j~0 1)} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {4842#true} ~j~0 := 1; {5032#(<= main_~j~0 1)} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {4842#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4842#true} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {4842#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; {4842#true} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {4842#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; {4842#true} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-15 05:42:26,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {4842#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; {4842#true} is VALID [2022-04-15 05:42:26,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4842#true} is VALID [2022-04-15 05:42:26,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-15 05:42:26,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-15 05:42:26,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-15 05:42:26,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#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); {4842#true} is VALID [2022-04-15 05:42:26,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4842#true} is VALID [2022-04-15 05:42:26,560 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-15 05:42:26,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513769737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:26,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 32 [2022-04-15 05:42:26,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:26,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543129344] [2022-04-15 05:42:26,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543129344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:26,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:26,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:42:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335481776] [2022-04-15 05:42:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 05:42:26,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:26,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:26,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:26,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:42:26,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:42:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:42:26,586 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:28,823 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2022-04-15 05:42:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 05:42:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 05:42:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 138 transitions. [2022-04-15 05:42:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 138 transitions. [2022-04-15 05:42:28,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 138 transitions. [2022-04-15 05:42:28,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:28,947 INFO L225 Difference]: With dead ends: 164 [2022-04-15 05:42:28,947 INFO L226 Difference]: Without dead ends: 162 [2022-04-15 05:42:28,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=580, Invalid=3080, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 05:42:28,948 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 171 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:28,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 75 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 05:42:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-15 05:42:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 84. [2022-04-15 05:42:29,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:29,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:29,208 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:29,208 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:29,211 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-15 05:42:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2022-04-15 05:42:29,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:29,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:29,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 162 states. [2022-04-15 05:42:29,212 INFO L87 Difference]: Start difference. First operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 162 states. [2022-04-15 05:42:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:29,216 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-15 05:42:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2022-04-15 05:42:29,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:29,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:29,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:29,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-15 05:42:29,219 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 36 [2022-04-15 05:42:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:29,220 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-15 05:42:29,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:29,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 107 transitions. [2022-04-15 05:42:29,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-15 05:42:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:42:29,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:29,389 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:29,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 05:42:29,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 05:42:29,595 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 3 times [2022-04-15 05:42:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:29,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1605211478] [2022-04-15 05:42:29,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:29,611 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:29,611 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 4 times [2022-04-15 05:42:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:29,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573599909] [2022-04-15 05:42:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:30,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(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); {5970#true} is VALID [2022-04-15 05:42:30,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-15 05:42:30,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-15 05:42:30,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:30,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#(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); {5970#true} is VALID [2022-04-15 05:42:30,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-15 05:42:30,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-15 05:42:30,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-15 05:42:30,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:42:30,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {5975#(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; {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 05:42:30,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:30,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {5976#(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; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:30,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {5976#(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; {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-15 05:42:30,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-15 05:42:30,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:30,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:30,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {5978#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:30,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(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; {5979#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-15 05:42:30,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {5979#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {5980#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4))) (not |main_#t~short10|)))} is VALID [2022-04-15 05:42:30,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {5980#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 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; {5981#(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-15 05:42:30,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {5981#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {5982#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)) (not (= 0 (* main_~i~0 4))))} is VALID [2022-04-15 05:42:30,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {5982#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)) (not (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {5983#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-15 05:42:30,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {5983#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|) (= (+ (- 1) main_~j~0) 0))} assume !#t~short10; {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:30,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-15 05:42:30,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {5984#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5985#(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-15 05:42:30,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {5985#(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; {5986#(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-15 05:42:30,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#(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; {5987#(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-15 05:42:30,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {5987#(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; {5987#(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-15 05:42:30,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {5987#(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; {5987#(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-15 05:42:30,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {5987#(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; {5987#(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-15 05:42:30,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {5987#(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); {5988#(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-15 05:42:30,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {5988#(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; {5988#(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-15 05:42:30,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {5988#(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); {5988#(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-15 05:42:30,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {5988#(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; {5989#(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-15 05:42:30,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(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); {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-15 05:42:30,110 INFO L272 TraceCheckUtils]: 32: Hoare triple {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5991#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:30,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {5991#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5992#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:30,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {5992#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5971#false} is VALID [2022-04-15 05:42:30,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-15 05:42:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:30,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573599909] [2022-04-15 05:42:30,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573599909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:30,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207451235] [2022-04-15 05:42:30,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:30,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:30,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:30,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:30,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 05:42:30,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:30,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:30,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 05:42:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:30,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:30,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:30,486 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-15 05:42:31,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:31,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 05:42:31,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:31,102 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-15 05:42:31,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:31,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:31,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 05:42:31,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:31,353 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-15 05:42:31,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 05:42:31,417 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-15 05:42:31,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5970#true} is VALID [2022-04-15 05:42:31,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#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); {5970#true} is VALID [2022-04-15 05:42:31,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-15 05:42:31,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-15 05:42:31,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-15 05:42:31,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {5978#(= |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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {5978#(= |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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {5978#(= |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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-15 05:42:31,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {5978#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:31,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(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; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-15 05:42:31,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6042#(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-15 05:42:31,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {6042#(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; {6046#(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-15 05:42:31,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {6046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0) (<= main_~j~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11;~i~0 := ~i~0 - 1; {6050#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-15 05:42:31,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {6050#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} #t~short10 := ~i~0 >= 0; {6054#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-15 05:42:31,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {6054#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-15 05:42:31,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-15 05:42:31,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5985#(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-15 05:42:31,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {5985#(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; {6068#(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-15 05:42:31,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {6068#(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; {6072#(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-15 05:42:31,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#(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; {6072#(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-15 05:42:31,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {6072#(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; {6072#(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-15 05:42:31,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {6072#(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; {6072#(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-15 05:42:31,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {6072#(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); {5988#(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-15 05:42:31,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {5988#(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; {5988#(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-15 05:42:31,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {5988#(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); {5988#(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-15 05:42:31,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {5988#(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; {5989#(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-15 05:42:31,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(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); {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-15 05:42:31,526 INFO L272 TraceCheckUtils]: 32: Hoare triple {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:31,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:31,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {6104#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5971#false} is VALID [2022-04-15 05:42:31,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-15 05:42:31,528 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-15 05:42:31,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:41,188 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-15 05:42:41,308 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-15 05:42:41,308 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 5429 treesize of output 5235 [2022-04-15 05:42:43,066 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 05:42:43,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:43,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:43,268 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:692) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:675) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:453) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 05:42:43,271 INFO L158 Benchmark]: Toolchain (without parser) took 56139.29ms. Allocated memory was 195.0MB in the beginning and 399.5MB in the end (delta: 204.5MB). Free memory was 145.5MB in the beginning and 278.6MB in the end (delta: -133.1MB). Peak memory consumption was 215.2MB. Max. memory is 8.0GB. [2022-04-15 05:42:43,271 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 161.8MB in the beginning and 161.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:43,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.67ms. Allocated memory is still 195.0MB. Free memory was 145.3MB in the beginning and 169.9MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 05:42:43,271 INFO L158 Benchmark]: Boogie Preprocessor took 41.81ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 168.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:42:43,271 INFO L158 Benchmark]: RCFGBuilder took 309.28ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 155.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 05:42:43,271 INFO L158 Benchmark]: TraceAbstraction took 55506.74ms. Allocated memory was 195.0MB in the beginning and 399.5MB in the end (delta: 204.5MB). Free memory was 155.0MB in the beginning and 278.6MB in the end (delta: -123.6MB). Peak memory consumption was 225.8MB. Max. memory is 8.0GB. [2022-04-15 05:42:43,272 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 161.8MB in the beginning and 161.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.67ms. Allocated memory is still 195.0MB. Free memory was 145.3MB in the beginning and 169.9MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.81ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 168.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 309.28ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 155.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 55506.74ms. Allocated memory was 195.0MB in the beginning and 399.5MB in the end (delta: 204.5MB). Free memory was 155.0MB in the beginning and 278.6MB in the end (delta: -123.6MB). Peak memory consumption was 225.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 05:42:43,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...