/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:50,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:50,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:50,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:50,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:50,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:50,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:50,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:50,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:50,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:50,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:50,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:50,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:50,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:50,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:50,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:50,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:50,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:50,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:50,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:50,311 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:50,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:50,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:50,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:50,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:50,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:50,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:50,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:50,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:50,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:50,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:50,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:50,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:50,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:50,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:50,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:50,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:50,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:50,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:50,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:50,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:50,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:50,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:50,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:50,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:50,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:50,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:50,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:50,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:50,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:50,372 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:50,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:50,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:50,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:50,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:50,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:50,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:50,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:50,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:50,375 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:50,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:50,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:50,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:50,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:50,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:50,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:50,377 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:50,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:50,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:50,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:16:50,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:50,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:50,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:50,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:50,619 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:50,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-1.c [2022-04-27 10:16:50,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac273575/fce6324e5f4f401fbe8995677caffb31/FLAG56ef9c0cc [2022-04-27 10:16:51,128 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:51,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-1.c [2022-04-27 10:16:51,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac273575/fce6324e5f4f401fbe8995677caffb31/FLAG56ef9c0cc [2022-04-27 10:16:51,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac273575/fce6324e5f4f401fbe8995677caffb31 [2022-04-27 10:16:51,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:51,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:51,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:51,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:51,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:51,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2143098b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:51,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:51,349 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/array-1.c[319,332] [2022-04-27 10:16:51,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:51,375 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:51,386 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/array-1.c[319,332] [2022-04-27 10:16:51,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:51,403 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:51,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51 WrapperNode [2022-04-27 10:16:51,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:51,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:51,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:51,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:51,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:51,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:51,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:51,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:51,462 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-27 10:16:51,468 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-27 10:16:51,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:51,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:51,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:51,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:51,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:51,554 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:51,555 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:51,691 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:51,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:51,697 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:16:51,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51 BoogieIcfgContainer [2022-04-27 10:16:51,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:51,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:51,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:51,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:51,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:51" (1/3) ... [2022-04-27 10:16:51,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13341562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (2/3) ... [2022-04-27 10:16:51,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13341562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51" (3/3) ... [2022-04-27 10:16:51,706 INFO L111 eAbstractionObserver]: Analyzing ICFG array-1.c [2022-04-27 10:16:51,719 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:51,719 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:51,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:51,774 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7eb81b80, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e53d0c8 [2022-04-27 10:16:51,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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-27 10:16:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:51,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 1 times [2022-04-27 10:16:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950273852] [2022-04-27 10:16:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-27 10:16:52,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:16:52,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-27 10:16:52,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-27 10:16:52,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:16:52,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-27 10:16:52,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret10 := main(); {25#true} is VALID [2022-04-27 10:16:52,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {25#true} is VALID [2022-04-27 10:16:52,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 10:16:52,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {26#false} is VALID [2022-04-27 10:16:52,068 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {26#false} is VALID [2022-04-27 10:16:52,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 10:16:52,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 10:16:52,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 10:16:52,070 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-27 10:16:52,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950273852] [2022-04-27 10:16:52,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950273852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:16:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156541777] [2022-04-27 10:16:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:16:52,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:52,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:52,152 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,250 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 10:16:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:52,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:16:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 10:16:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 10:16:52,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 10:16:52,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,325 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:16:52,325 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:16:52,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:52,335 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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-27 10:16:52,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:16:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:16:52,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,368 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,368 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,372 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:16:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:16:52,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:16:52,373 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:16:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,375 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:16:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:16:52,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 10:16:52,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 10:16:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,380 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 10:16:52,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:16:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:52,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:52,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 1 times [2022-04-27 10:16:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307990663] [2022-04-27 10:16:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(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(10, 2);call #Ultimate.allocInit(12, 3); {129#true} is VALID [2022-04-27 10:16:52,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:16:52,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #44#return; {129#true} is VALID [2022-04-27 10:16:52,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#(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(10, 2);call #Ultimate.allocInit(12, 3); {129#true} is VALID [2022-04-27 10:16:52,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} assume true; {129#true} is VALID [2022-04-27 10:16:52,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} #44#return; {129#true} is VALID [2022-04-27 10:16:52,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} call #t~ret10 := main(); {129#true} is VALID [2022-04-27 10:16:52,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {134#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-27 10:16:52,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {130#false} is VALID [2022-04-27 10:16:52,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {130#false} is VALID [2022-04-27 10:16:52,510 INFO L272 TraceCheckUtils]: 8: Hoare triple {130#false} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {130#false} is VALID [2022-04-27 10:16:52,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} ~cond := #in~cond; {130#false} is VALID [2022-04-27 10:16:52,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#false} assume 0 == ~cond; {130#false} is VALID [2022-04-27 10:16:52,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-04-27 10:16:52,511 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-27 10:16:52,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307990663] [2022-04-27 10:16:52,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307990663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600798515] [2022-04-27 10:16:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:16:52,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:52,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:52,528 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,623 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 10:16:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:16:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:16:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:16:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:16:52,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 10:16:52,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,665 INFO L225 Difference]: With dead ends: 24 [2022-04-27 10:16:52,665 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 10:16:52,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:52,672 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 10:16:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-27 10:16:52,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,682 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,682 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,686 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 10:16:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:16:52,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:16:52,692 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:16:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,695 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 10:16:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:16:52,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 10:16:52,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-27 10:16:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,698 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 10:16:52,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 10:16:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:16:52,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:52,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 1 times [2022-04-27 10:16:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080141213] [2022-04-27 10:16:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#(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(10, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-27 10:16:53,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-27 10:16:53,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #44#return; {234#true} is VALID [2022-04-27 10:16:53,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:53,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#(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(10, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-27 10:16:53,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-27 10:16:53,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #44#return; {234#true} is VALID [2022-04-27 10:16:53,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret10 := main(); {234#true} is VALID [2022-04-27 10:16:53,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {239#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (= |main_~#array~0.offset| 0) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (or (<= main_~SIZE~0 1) (not (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296))))) (<= (+ (* main_~j~0 4) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296)))))} is VALID [2022-04-27 10:16:53,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (= |main_~#array~0.offset| 0) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (or (<= main_~SIZE~0 1) (not (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296))))) (<= (+ (* main_~j~0 4) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {240#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|) |main_~#array~0.offset|) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} is VALID [2022-04-27 10:16:53,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|) |main_~#array~0.offset|) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {241#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (* 17179869184 (div main_~j~0 4294967296)) (* main_~j~0 4)) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-27 10:16:53,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (* 17179869184 (div main_~j~0 4294967296)) (* main_~j~0 4)) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {242#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-27 10:16:53,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-27 10:16:53,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {244#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-27 10:16:53,580 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {245#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:53,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {246#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:53,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-27 10:16:53,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-27 10:16:53,581 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-27 10:16:53,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080141213] [2022-04-27 10:16:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080141213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:53,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728361392] [2022-04-27 10:16:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:53,591 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-27 10:16:53,622 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-27 10:16:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 10:16:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:53,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-04-27 10:16:54,040 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 15 treesize of output 7 [2022-04-27 10:16:54,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-27 10:16:54,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(10, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-27 10:16:54,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-27 10:16:54,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #44#return; {234#true} is VALID [2022-04-27 10:16:54,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret10 := main(); {234#true} is VALID [2022-04-27 10:16:54,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {266#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-27 10:16:54,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {266#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-27 10:16:54,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {273#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|))) (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-27 10:16:54,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|))) (= main_~j~0 0) (= main_~SIZE~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {277#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~j~0) 0) (= main_~SIZE~0 1))} is VALID [2022-04-27 10:16:54,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~j~0) 0) (= main_~SIZE~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-27 10:16:54,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {244#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-27 10:16:54,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:16:54,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:16:54,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {235#false} is VALID [2022-04-27 10:16:54,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-27 10:16:54,152 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-27 10:16:54,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:54,591 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 16 treesize of output 14 [2022-04-27 10:16:54,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:16:54,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-04-27 10:16:54,652 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 15 treesize of output 13 [2022-04-27 10:16:54,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:16:54,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-27 10:16:54,686 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-27 10:16:54,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2022-04-27 10:16:54,710 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-04-27 10:16:54,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 3 [2022-04-27 10:16:54,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-27 10:16:54,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {235#false} is VALID [2022-04-27 10:16:54,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:16:54,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#(<= main_~menor~0 |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 >= ~menor~0 then 1 else 0)); {287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:16:54,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {244#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-27 10:16:54,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-27 10:16:54,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {317#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {313#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-27 10:16:54,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {321#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} assume #t~mem7 <= ~menor~0;havoc #t~mem7;call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem8;havoc #t~mem8; {317#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-27 10:16:54,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (mod main_~j~0 4294967296) 4) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {321#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-27 10:16:54,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {325#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (mod main_~j~0 4294967296) 4) 0))} is VALID [2022-04-27 10:16:54,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret10 := main(); {234#true} is VALID [2022-04-27 10:16:54,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #44#return; {234#true} is VALID [2022-04-27 10:16:54,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-27 10:16:54,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(10, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-27 10:16:54,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-27 10:16:54,814 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-27 10:16:54,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728361392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:54,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:54,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 20 [2022-04-27 10:16:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945098611] [2022-04-27 10:16:54,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:54,815 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:16:54,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:54,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,855 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-27 10:16:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:16:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:16:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:16:54,860 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,387 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-27 10:16:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:16:55,387 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:16:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-27 10:16:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-27 10:16:55,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2022-04-27 10:16:55,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:55,421 INFO L225 Difference]: With dead ends: 23 [2022-04-27 10:16:55,421 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:16:55,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:16:55,423 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:55,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:16:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:16:55,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:55,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:55,424 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:55,424 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:16:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:16:55,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:55,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:16:55,425 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:16:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,425 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:16:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:16:55,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:55,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:55,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:16:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:16:55,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-27 10:16:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:55,426 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:16:55,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:16:55,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:16:55,458 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-27 10:16:55,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:55,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:16:55,704 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:16:55,704 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:16:55,704 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:16:55,704 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2022-04-27 10:16:55,705 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= main_~menor~0 |main_#t~mem9|) (= |main_~#array~0.offset| 0) (= main_~j~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#array~0.offset|))) (= main_~SIZE~0 1)) [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 31) no Hoare annotation was computed. [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 25) no Hoare annotation was computed. [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 26) no Hoare annotation was computed. [2022-04-27 10:16:55,705 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 26) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= main_~SIZE~0 1))) (or (and .cse0 (= main_~j~0 0) .cse1) (and .cse0 (= main_~j~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#array~0.offset|))) .cse1))) [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point L21-4(lines 21 26) no Hoare annotation was computed. [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 31) no Hoare annotation was computed. [2022-04-27 10:16:55,705 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:16:55,706 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:16:55,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:16:55,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:16:55,710 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:16:55,710 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:16:55,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:16:55,710 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 10:16:55,710 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:16:55,710 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:16:55,710 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:16:55,711 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:16:55,712 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 10:16:55,714 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 10:16:55,716 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:16:55,720 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:16:55,720 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:16:55,723 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:16:55,724 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 10:16:55,725 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 10:16:55,725 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:16:55,725 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 10:16:55,725 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:16:55,725 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:16:55,725 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:16:55,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:16:55 BoogieIcfgContainer [2022-04-27 10:16:55,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:16:55,746 INFO L158 Benchmark]: Toolchain (without parser) took 4576.11ms. Allocated memory was 196.1MB in the beginning and 295.7MB in the end (delta: 99.6MB). Free memory was 136.5MB in the beginning and 195.1MB in the end (delta: -58.6MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2022-04-27 10:16:55,746 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:16:55,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.34ms. Allocated memory was 196.1MB in the beginning and 295.7MB in the end (delta: 99.6MB). Free memory was 168.0MB in the beginning and 265.5MB in the end (delta: -97.5MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-04-27 10:16:55,746 INFO L158 Benchmark]: Boogie Preprocessor took 25.85ms. Allocated memory is still 295.7MB. Free memory was 265.5MB in the beginning and 264.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:16:55,749 INFO L158 Benchmark]: RCFGBuilder took 267.41ms. Allocated memory is still 295.7MB. Free memory was 263.4MB in the beginning and 250.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:16:55,749 INFO L158 Benchmark]: TraceAbstraction took 4044.44ms. Allocated memory is still 295.7MB. Free memory was 250.3MB in the beginning and 195.1MB in the end (delta: 55.3MB). Peak memory consumption was 56.8MB. Max. memory is 8.0GB. [2022-04-27 10:16:55,750 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.14ms. Allocated memory is still 196.1MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.34ms. Allocated memory was 196.1MB in the beginning and 295.7MB in the end (delta: 99.6MB). Free memory was 168.0MB in the beginning and 265.5MB in the end (delta: -97.5MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.85ms. Allocated memory is still 295.7MB. Free memory was 265.5MB in the beginning and 264.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 267.41ms. Allocated memory is still 295.7MB. Free memory was 263.4MB in the beginning and 250.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4044.44ms. Allocated memory is still 295.7MB. Free memory was 250.3MB in the beginning and 195.1MB in the end (delta: 55.3MB). Peak memory consumption was 56.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 42 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 75 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 SizeOfPredicates, 9 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((array == 0 && j == 0) && SIZE == 1) || (((array == 0 && j == 1) && menor <= unknown-#memory_int-unknown[array][(j + 4294967295) % 4294967296 * 4 + array]) && SIZE == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:16:55,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...