/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/loop-crafted/simple_array_index_value_3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:44:12,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:44:12,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:44:12,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:44:12,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:44:12,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:44:12,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:44:12,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:44:12,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:44:12,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:44:12,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:44:12,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:44:12,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:44:12,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:44:12,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:44:12,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:44:12,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:44:12,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:44:12,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:44:12,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:44:12,377 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:44:12,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:44:12,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:44:12,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:44:12,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:44:12,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:44:12,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:44:12,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:44:12,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:44:12,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:44:12,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:44:12,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:44:12,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:44:12,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:44:12,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:44:12,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:44:12,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:44:12,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:44:12,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:44:12,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:44:12,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:44:12,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:44:12,389 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:44:12,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:44:12,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:44:12,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:44:12,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:44:12,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:44:12,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:44:12,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:44:12,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:44:12,403 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:44:12,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:44:12,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:44:12,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:44:12,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:44:12,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:44:12,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:44:12,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:44:12,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:44:12,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:44:12,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:44:12,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:44:12,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:44:12,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:44:12,406 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:44:12,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:44:12,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:44:12,406 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:44:12,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:44:12,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:44:12,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:44:12,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:44:12,610 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:44:12,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-27 10:44:12,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804bf74d4/713a232e70b04609801094058cbd874a/FLAGdf3c41c76 [2022-04-27 10:44:13,006 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:44:13,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-27 10:44:13,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804bf74d4/713a232e70b04609801094058cbd874a/FLAGdf3c41c76 [2022-04-27 10:44:13,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804bf74d4/713a232e70b04609801094058cbd874a [2022-04-27 10:44:13,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:44:13,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:44:13,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:44:13,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:44:13,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:44:13,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2918ae91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13, skipping insertion in model container [2022-04-27 10:44:13,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:44:13,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:44:13,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i[920,933] [2022-04-27 10:44:13,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:44:13,167 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:44:13,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i[920,933] [2022-04-27 10:44:13,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:44:13,188 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:44:13,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13 WrapperNode [2022-04-27 10:44:13,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:44:13,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:44:13,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:44:13,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:44:13,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:44:13,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:44:13,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:44:13,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:44:13,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (1/1) ... [2022-04-27 10:44:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:44:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:13,243 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:44:13,260 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:44:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:44:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:44:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:44:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:44:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:44:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:44:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:44:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:44:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:44:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:44:13,317 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:44:13,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:44:13,509 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:44:13,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:44:13,515 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:44:13,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:44:13 BoogieIcfgContainer [2022-04-27 10:44:13,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:44:13,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:44:13,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:44:13,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:44:13,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:44:13" (1/3) ... [2022-04-27 10:44:13,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd57258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:44:13, skipping insertion in model container [2022-04-27 10:44:13,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:13" (2/3) ... [2022-04-27 10:44:13,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd57258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:44:13, skipping insertion in model container [2022-04-27 10:44:13,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:44:13" (3/3) ... [2022-04-27 10:44:13,523 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2022-04-27 10:44:13,535 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:44:13,536 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:44:13,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:44:13,584 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@58823330, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b4f02d1 [2022-04-27 10:44:13,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:44:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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:44:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:44:13,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:13,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:13,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 1 times [2022-04-27 10:44:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359334857] [2022-04-27 10:44:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:13,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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(29, 2); {27#true} is VALID [2022-04-27 10:44:13,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:44:13,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-27 10:44:13,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:13,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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(29, 2); {27#true} is VALID [2022-04-27 10:44:13,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:44:13,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-27 10:44:13,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-27 10:44:13,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {27#true} is VALID [2022-04-27 10:44:13,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~index~0 % 4294967296 < 10000); {27#true} is VALID [2022-04-27 10:44:13,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~index~0 := 0; {27#true} is VALID [2022-04-27 10:44:13,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {27#true} is VALID [2022-04-27 10:44:13,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume #t~short4; {32#|main_#t~short4|} is VALID [2022-04-27 10:44:13,871 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:44:13,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:13,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-27 10:44:13,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 10:44:13,873 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:44:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:13,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359334857] [2022-04-27 10:44:13,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359334857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:13,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:13,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797634181] [2022-04-27 10:44:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-27 10:44:13,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:13,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:13,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:13,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:13,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:13,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:13,923 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:14,191 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 10:44:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:44:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-27 10:44:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-27 10:44:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-27 10:44:14,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-27 10:44:14,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:14,258 INFO L225 Difference]: With dead ends: 47 [2022-04-27 10:44:14,258 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 10:44:14,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:44:14,262 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:14,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:44:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 10:44:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 10:44:14,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:14,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,282 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,282 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:14,288 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 10:44:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 10:44:14,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:14,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:14,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 10:44:14,290 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 10:44:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:14,292 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 10:44:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 10:44:14,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:14,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:14,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:14,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 10:44:14,298 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-27 10:44:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:14,298 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 10:44:14,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 10:44:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:44:14,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:14,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:14,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:44:14,300 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 1 times [2022-04-27 10:44:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:14,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578325321] [2022-04-27 10:44:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:14,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#(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(29, 2); {190#true} is VALID [2022-04-27 10:44:14,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-27 10:44:14,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #71#return; {190#true} is VALID [2022-04-27 10:44:14,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:14,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#(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(29, 2); {190#true} is VALID [2022-04-27 10:44:14,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-27 10:44:14,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #71#return; {190#true} is VALID [2022-04-27 10:44:14,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret5 := main(); {190#true} is VALID [2022-04-27 10:44:14,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {195#(= main_~index~0 0)} is VALID [2022-04-27 10:44:14,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {191#false} is VALID [2022-04-27 10:44:14,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} ~index~0 := 0; {191#false} is VALID [2022-04-27 10:44:14,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {191#false} is VALID [2022-04-27 10:44:14,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {191#false} is VALID [2022-04-27 10:44:14,369 INFO L272 TraceCheckUtils]: 10: Hoare triple {191#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {191#false} is VALID [2022-04-27 10:44:14,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-27 10:44:14,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-27 10:44:14,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-27 10:44:14,370 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:44:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:14,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578325321] [2022-04-27 10:44:14,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578325321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:14,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:14,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:44:14,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642372633] [2022-04-27 10:44:14,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-27 10:44:14,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:14,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:14,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:44:14,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:44:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:44:14,386 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:14,485 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 10:44:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:44:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-27 10:44:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-27 10:44:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-27 10:44:14,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-27 10:44:14,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:14,535 INFO L225 Difference]: With dead ends: 48 [2022-04-27 10:44:14,535 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 10:44:14,538 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:44:14,540 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:14,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:44:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 10:44:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-27 10:44:14,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:14,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,550 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,550 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:14,553 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 10:44:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-27 10:44:14,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:14,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:14,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-27 10:44:14,554 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-27 10:44:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:14,556 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 10:44:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-27 10:44:14,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:14,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:14,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:14,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 10:44:14,558 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-27 10:44:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:14,558 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 10:44:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 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:44:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 10:44:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:44:14,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:14,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:14,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:44:14,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 1 times [2022-04-27 10:44:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:14,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938614364] [2022-04-27 10:44:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:14,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#(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(29, 2); {366#true} is VALID [2022-04-27 10:44:14,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {366#true} assume true; {366#true} is VALID [2022-04-27 10:44:14,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {366#true} {366#true} #71#return; {366#true} is VALID [2022-04-27 10:44:14,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:14,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {373#(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(29, 2); {366#true} is VALID [2022-04-27 10:44:14,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2022-04-27 10:44:14,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #71#return; {366#true} is VALID [2022-04-27 10:44:14,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret5 := main(); {366#true} is VALID [2022-04-27 10:44:14,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {371#(= main_~index~0 0)} is VALID [2022-04-27 10:44:14,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {372#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:44:14,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {367#false} is VALID [2022-04-27 10:44:14,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#false} ~index~0 := 0; {367#false} is VALID [2022-04-27 10:44:14,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {367#false} is VALID [2022-04-27 10:44:14,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {367#false} is VALID [2022-04-27 10:44:14,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {367#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {367#false} is VALID [2022-04-27 10:44:14,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {367#false} ~cond := #in~cond; {367#false} is VALID [2022-04-27 10:44:14,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {367#false} assume 0 == ~cond; {367#false} is VALID [2022-04-27 10:44:14,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {367#false} assume !false; {367#false} is VALID [2022-04-27 10:44:14,676 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:44:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:14,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938614364] [2022-04-27 10:44:14,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938614364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:14,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249029195] [2022-04-27 10:44:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:14,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:14,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:14,680 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:44:14,681 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:44:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:14,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 10:44:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:14,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:14,818 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 11 treesize of output 7 [2022-04-27 10:44:14,920 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 33 treesize of output 21 [2022-04-27 10:44:14,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2022-04-27 10:44:14,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {366#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(29, 2); {366#true} is VALID [2022-04-27 10:44:14,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2022-04-27 10:44:14,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #71#return; {366#true} is VALID [2022-04-27 10:44:14,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret5 := main(); {366#true} is VALID [2022-04-27 10:44:14,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {392#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-27 10:44:14,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {392#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {396#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-27 10:44:14,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {396#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-27 10:44:14,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {403#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-27 10:44:14,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {403#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {407#|main_#t~short4|} is VALID [2022-04-27 10:44:14,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {407#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {367#false} is VALID [2022-04-27 10:44:14,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {367#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {367#false} is VALID [2022-04-27 10:44:14,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {367#false} ~cond := #in~cond; {367#false} is VALID [2022-04-27 10:44:14,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {367#false} assume 0 == ~cond; {367#false} is VALID [2022-04-27 10:44:14,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {367#false} assume !false; {367#false} is VALID [2022-04-27 10:44:14,957 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:44:14,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:15,167 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 18 treesize of output 16 [2022-04-27 10:44:15,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 32 [2022-04-27 10:44:15,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {367#false} assume !false; {367#false} is VALID [2022-04-27 10:44:15,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {367#false} assume 0 == ~cond; {367#false} is VALID [2022-04-27 10:44:15,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {367#false} ~cond := #in~cond; {367#false} is VALID [2022-04-27 10:44:15,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {367#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {367#false} is VALID [2022-04-27 10:44:15,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {407#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {367#false} is VALID [2022-04-27 10:44:15,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {407#|main_#t~short4|} is VALID [2022-04-27 10:44:15,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {442#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {438#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:15,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {442#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 10000); {442#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-27 10:44:15,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#(or (and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {442#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-27 10:44:15,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {449#(or (and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:15,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret5 := main(); {366#true} is VALID [2022-04-27 10:44:15,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #71#return; {366#true} is VALID [2022-04-27 10:44:15,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2022-04-27 10:44:15,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {366#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(29, 2); {366#true} is VALID [2022-04-27 10:44:15,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2022-04-27 10:44:15,256 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:44:15,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249029195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:15,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:15,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-04-27 10:44:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708953408] [2022-04-27 10:44:15,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:15,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:44:15,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:15,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:15,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:15,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:44:15,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:44:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:44:15,286 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:15,717 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-27 10:44:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:44:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:44:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2022-04-27 10:44:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2022-04-27 10:44:15,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2022-04-27 10:44:15,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:15,769 INFO L225 Difference]: With dead ends: 58 [2022-04-27 10:44:15,769 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 10:44:15,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:44:15,770 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:15,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 41 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 105 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-04-27 10:44:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 10:44:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-04-27 10:44:15,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:15,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:15,788 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:15,788 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:15,793 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 10:44:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 10:44:15,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:15,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:15,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-27 10:44:15,794 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-27 10:44:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:15,796 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 10:44:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 10:44:15,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:15,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:15,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:15,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 10:44:15,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-27 10:44:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:15,798 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 10:44:15,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 10:44:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:44:15,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:15,799 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:15,818 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:44:15,999 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:44:16,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 2 times [2022-04-27 10:44:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930870277] [2022-04-27 10:44:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:16,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {695#(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(29, 2); {687#true} is VALID [2022-04-27 10:44:16,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-27 10:44:16,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {687#true} {687#true} #71#return; {687#true} is VALID [2022-04-27 10:44:16,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:16,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#(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(29, 2); {687#true} is VALID [2022-04-27 10:44:16,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-27 10:44:16,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #71#return; {687#true} is VALID [2022-04-27 10:44:16,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret5 := main(); {687#true} is VALID [2022-04-27 10:44:16,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {692#(= main_~index~0 0)} is VALID [2022-04-27 10:44:16,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {692#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {693#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:16,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {694#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:44:16,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {694#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {688#false} is VALID [2022-04-27 10:44:16,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#false} ~index~0 := 0; {688#false} is VALID [2022-04-27 10:44:16,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {688#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {688#false} is VALID [2022-04-27 10:44:16,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {688#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {688#false} is VALID [2022-04-27 10:44:16,087 INFO L272 TraceCheckUtils]: 12: Hoare triple {688#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {688#false} is VALID [2022-04-27 10:44:16,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#false} ~cond := #in~cond; {688#false} is VALID [2022-04-27 10:44:16,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#false} assume 0 == ~cond; {688#false} is VALID [2022-04-27 10:44:16,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {688#false} assume !false; {688#false} is VALID [2022-04-27 10:44:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930870277] [2022-04-27 10:44:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930870277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:16,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492880656] [2022-04-27 10:44:16,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:44:16,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:16,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:44:16,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:44:16,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:44:16,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:44:16,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 10:44:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:16,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:16,189 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 11 treesize of output 7 [2022-04-27 10:44:16,228 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 10:44:16,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-27 10:44:16,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {687#true} is VALID [2022-04-27 10:44:16,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#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(29, 2); {687#true} is VALID [2022-04-27 10:44:16,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-27 10:44:16,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #71#return; {687#true} is VALID [2022-04-27 10:44:16,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret5 := main(); {687#true} is VALID [2022-04-27 10:44:16,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {714#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-27 10:44:16,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {718#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-27 10:44:16,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {718#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {722#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-27 10:44:16,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {722#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-27 10:44:16,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {729#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-27 10:44:16,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {729#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {733#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-27 10:44:16,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {688#false} is VALID [2022-04-27 10:44:16,299 INFO L272 TraceCheckUtils]: 12: Hoare triple {688#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {688#false} is VALID [2022-04-27 10:44:16,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#false} ~cond := #in~cond; {688#false} is VALID [2022-04-27 10:44:16,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#false} assume 0 == ~cond; {688#false} is VALID [2022-04-27 10:44:16,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {688#false} assume !false; {688#false} is VALID [2022-04-27 10:44:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:16,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:17,023 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 61 treesize of output 57 [2022-04-27 10:44:17,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 130 treesize of output 126 [2022-04-27 10:44:17,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {688#false} assume !false; {688#false} is VALID [2022-04-27 10:44:17,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {752#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {688#false} is VALID [2022-04-27 10:44:17,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {756#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {752#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:17,242 INFO L272 TraceCheckUtils]: 12: Hoare triple {760#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {756#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:44:17,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {764#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {760#|main_#t~short4|} is VALID [2022-04-27 10:44:17,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {768#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {764#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) |main_#t~short4|)} is VALID [2022-04-27 10:44:17,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {772#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {768#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:17,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {772#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 10000); {772#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-27 10:44:17,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#(or (not (< (mod main_~index~0 4294967296) 10000)) (forall ((v_ArrVal_29 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {772#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-27 10:44:17,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#(or (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {779#(or (not (< (mod main_~index~0 4294967296) 10000)) (forall ((v_ArrVal_29 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-27 10:44:17,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {783#(or (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:17,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret5 := main(); {687#true} is VALID [2022-04-27 10:44:17,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #71#return; {687#true} is VALID [2022-04-27 10:44:17,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-27 10:44:17,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#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(29, 2); {687#true} is VALID [2022-04-27 10:44:17,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {687#true} is VALID [2022-04-27 10:44:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:17,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492880656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:17,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:17,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 19 [2022-04-27 10:44:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761785693] [2022-04-27 10:44:17,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:17,260 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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 16 [2022-04-27 10:44:17,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:17,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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:44:17,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:17,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:44:17,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:44:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:44:17,296 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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:44:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:18,168 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 10:44:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 10:44:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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 16 [2022-04-27 10:44:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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:44:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-27 10:44:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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:44:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-27 10:44:18,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-27 10:44:18,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:18,227 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:44:18,227 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 10:44:18,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:44:18,228 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:18,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 73 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 307 Invalid, 0 Unknown, 77 Unchecked, 0.4s Time] [2022-04-27 10:44:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 10:44:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-04-27 10:44:18,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:18,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:18,240 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:18,240 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:18,242 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-27 10:44:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-27 10:44:18,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:18,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:18,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-27 10:44:18,243 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-27 10:44:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:18,259 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-27 10:44:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-27 10:44:18,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:18,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:18,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:18,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-27 10:44:18,261 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-27 10:44:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:18,261 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-27 10:44:18,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 3 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:44:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 10:44:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:44:18,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:18,262 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:18,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:44:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:44:18,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 3 times [2022-04-27 10:44:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830657480] [2022-04-27 10:44:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:18,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {1070#(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(29, 2); {1061#true} is VALID [2022-04-27 10:44:18,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-27 10:44:18,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #71#return; {1061#true} is VALID [2022-04-27 10:44:18,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:18,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#(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(29, 2); {1061#true} is VALID [2022-04-27 10:44:18,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-27 10:44:18,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #71#return; {1061#true} is VALID [2022-04-27 10:44:18,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret5 := main(); {1061#true} is VALID [2022-04-27 10:44:18,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1066#(= main_~index~0 0)} is VALID [2022-04-27 10:44:18,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1067#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:18,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1068#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:44:18,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1069#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#false} ~index~0 := 0; {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {1062#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L272 TraceCheckUtils]: 13: Hoare triple {1062#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#false} ~cond := #in~cond; {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1062#false} assume 0 == ~cond; {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-27 10:44:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:18,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830657480] [2022-04-27 10:44:18,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830657480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:18,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836320533] [2022-04-27 10:44:18,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:44:18,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:18,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:18,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:44:18,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:44:18,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 10:44:18,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:44:18,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 10:44:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:18,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:18,650 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 21 treesize of output 17 [2022-04-27 10:44:18,686 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-27 10:44:18,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:44:18,729 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-04-27 10:44:18,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-04-27 10:44:18,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2022-04-27 10:44:18,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#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(29, 2); {1061#true} is VALID [2022-04-27 10:44:18,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-27 10:44:18,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #71#return; {1061#true} is VALID [2022-04-27 10:44:18,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret5 := main(); {1061#true} is VALID [2022-04-27 10:44:18,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1089#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-27 10:44:18,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {1089#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1093#(and (= main_~tmp~0 2) (= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 2) main_~tmp~0) (= main_~index~0 1))} is VALID [2022-04-27 10:44:18,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#(and (= main_~tmp~0 2) (= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 2) main_~tmp~0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1097#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-27 10:44:18,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1101#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-27 10:44:18,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1101#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 10000); {1101#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-27 10:44:18,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {1101#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} ~index~0 := 0; {1108#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-27 10:44:18,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {1108#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1112#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-27 10:44:18,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {1112#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1062#false} is VALID [2022-04-27 10:44:18,807 INFO L272 TraceCheckUtils]: 13: Hoare triple {1062#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1062#false} is VALID [2022-04-27 10:44:18,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {1062#false} ~cond := #in~cond; {1062#false} is VALID [2022-04-27 10:44:18,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {1062#false} assume 0 == ~cond; {1062#false} is VALID [2022-04-27 10:44:18,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-27 10:44:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:18,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:19,488 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 87 treesize of output 83 [2022-04-27 10:44:19,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2406 treesize of output 2374 [2022-04-27 10:44:20,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-27 10:44:20,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1062#false} is VALID [2022-04-27 10:44:20,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1131#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:20,853 INFO L272 TraceCheckUtils]: 13: Hoare triple {1139#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1135#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:44:20,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {1143#(or (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1139#|main_#t~short4|} is VALID [2022-04-27 10:44:20,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {1147#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1143#(or (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))) |main_#t~short4|)} is VALID [2022-04-27 10:44:20,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {1151#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {1147#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:20,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {1151#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 10000); {1151#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-27 10:44:20,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {1158#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1151#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-27 10:44:20,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1158#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:20,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)) (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (= (* (mod main_~index~0 4294967296) 4) 0)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1162#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-27 10:44:20,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1166#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)) (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (= (* (mod main_~index~0 4294967296) 4) 0)))} is VALID [2022-04-27 10:44:20,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret5 := main(); {1061#true} is VALID [2022-04-27 10:44:20,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #71#return; {1061#true} is VALID [2022-04-27 10:44:20,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-27 10:44:20,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#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(29, 2); {1061#true} is VALID [2022-04-27 10:44:20,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2022-04-27 10:44:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:20,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836320533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:20,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:20,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 22 [2022-04-27 10:44:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653142859] [2022-04-27 10:44:20,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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 17 [2022-04-27 10:44:20,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:20,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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:44:20,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:20,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:44:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:44:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:44:20,910 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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:44:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:22,561 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-27 10:44:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 10:44:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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 17 [2022-04-27 10:44:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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:44:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 82 transitions. [2022-04-27 10:44:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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:44:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 82 transitions. [2022-04-27 10:44:22,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 82 transitions. [2022-04-27 10:44:22,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:22,666 INFO L225 Difference]: With dead ends: 72 [2022-04-27 10:44:22,666 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 10:44:22,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 10:44:22,667 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 108 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:22,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 75 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 389 Invalid, 0 Unknown, 59 Unchecked, 0.6s Time] [2022-04-27 10:44:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 10:44:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2022-04-27 10:44:22,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:22,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:22,692 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:22,692 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:22,696 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-27 10:44:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-27 10:44:22,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:22,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:22,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-04-27 10:44:22,698 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-04-27 10:44:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:22,702 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-27 10:44:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-27 10:44:22,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:22,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:22,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 10:44:22,704 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 10:44:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:22,705 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 10:44:22,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 3 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:44:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 10:44:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:44:22,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:22,706 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:22,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:44:22,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:22,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1582471557, now seen corresponding path program 1 times [2022-04-27 10:44:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:22,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000512945] [2022-04-27 10:44:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:23,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {1496#(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(29, 2); {1482#true} is VALID [2022-04-27 10:44:23,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1482#true} {1482#true} #71#return; {1482#true} is VALID [2022-04-27 10:44:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 10:44:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:23,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {1482#true} ~cond := #in~cond; {1482#true} is VALID [2022-04-27 10:44:23,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1482#true} assume !(0 == ~cond); {1482#true} is VALID [2022-04-27 10:44:23,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1482#true} {1483#false} #69#return; {1483#false} is VALID [2022-04-27 10:44:23,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {1482#true} call ULTIMATE.init(); {1496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:23,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#(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(29, 2); {1482#true} is VALID [2022-04-27 10:44:23,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1482#true} {1482#true} #71#return; {1482#true} is VALID [2022-04-27 10:44:23,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {1482#true} call #t~ret5 := main(); {1482#true} is VALID [2022-04-27 10:44:23,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {1482#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1487#(= main_~index~0 0)} is VALID [2022-04-27 10:44:23,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1487#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1488#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:23,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {1488#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1489#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:44:23,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1490#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:44:23,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1491#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-27 10:44:23,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {1491#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 10000); {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#false} ~index~0 := 0; {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {1483#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#false} assume #t~short4; {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L272 TraceCheckUtils]: 14: Hoare triple {1483#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1482#true} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {1482#true} ~cond := #in~cond; {1482#true} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {1482#true} assume !(0 == ~cond); {1482#true} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,072 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1482#true} {1483#false} #69#return; {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {1483#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1483#false} is VALID [2022-04-27 10:44:23,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {1483#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {1483#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,073 INFO L272 TraceCheckUtils]: 23: Hoare triple {1483#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1483#false} is VALID [2022-04-27 10:44:23,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {1483#false} ~cond := #in~cond; {1483#false} is VALID [2022-04-27 10:44:23,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {1483#false} assume 0 == ~cond; {1483#false} is VALID [2022-04-27 10:44:23,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {1483#false} assume !false; {1483#false} is VALID [2022-04-27 10:44:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:44:23,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:23,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000512945] [2022-04-27 10:44:23,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000512945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:23,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380886990] [2022-04-27 10:44:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:23,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:23,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:23,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:44:23,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:44:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 10:44:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:23,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:23,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1482#true} call ULTIMATE.init(); {1482#true} is VALID [2022-04-27 10:44:23,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1482#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(29, 2); {1482#true} is VALID [2022-04-27 10:44:23,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1482#true} {1482#true} #71#return; {1482#true} is VALID [2022-04-27 10:44:23,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {1482#true} call #t~ret5 := main(); {1482#true} is VALID [2022-04-27 10:44:23,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {1482#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1487#(= main_~index~0 0)} is VALID [2022-04-27 10:44:23,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {1487#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1488#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:23,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1488#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1489#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:44:23,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1490#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:44:23,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1527#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:44:23,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 10000); {1483#false} is VALID [2022-04-27 10:44:23,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#false} ~index~0 := 0; {1483#false} is VALID [2022-04-27 10:44:23,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1483#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#false} assume #t~short4; {1483#false} is VALID [2022-04-27 10:44:23,295 INFO L272 TraceCheckUtils]: 14: Hoare triple {1483#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1483#false} is VALID [2022-04-27 10:44:23,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {1483#false} ~cond := #in~cond; {1483#false} is VALID [2022-04-27 10:44:23,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {1483#false} assume !(0 == ~cond); {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1483#false} assume true; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1483#false} {1483#false} #69#return; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {1483#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {1483#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {1483#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L272 TraceCheckUtils]: 23: Hoare triple {1483#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {1483#false} ~cond := #in~cond; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {1483#false} assume 0 == ~cond; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {1483#false} assume !false; {1483#false} is VALID [2022-04-27 10:44:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:44:23,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:23,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {1483#false} assume !false; {1483#false} is VALID [2022-04-27 10:44:23,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {1483#false} assume 0 == ~cond; {1483#false} is VALID [2022-04-27 10:44:23,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {1483#false} ~cond := #in~cond; {1483#false} is VALID [2022-04-27 10:44:23,413 INFO L272 TraceCheckUtils]: 23: Hoare triple {1483#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {1483#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {1483#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {1483#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1482#true} {1483#false} #69#return; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {1482#true} assume !(0 == ~cond); {1482#true} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {1482#true} ~cond := #in~cond; {1482#true} is VALID [2022-04-27 10:44:23,414 INFO L272 TraceCheckUtils]: 14: Hoare triple {1483#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1482#true} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#false} assume #t~short4; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {1483#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1483#false} is VALID [2022-04-27 10:44:23,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#false} ~index~0 := 0; {1483#false} is VALID [2022-04-27 10:44:23,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1627#(< (mod main_~index~0 4294967296) 10000)} assume !(~index~0 % 4294967296 < 10000); {1483#false} is VALID [2022-04-27 10:44:23,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {1631#(< (mod (+ main_~index~0 1) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1627#(< (mod main_~index~0 4294967296) 10000)} is VALID [2022-04-27 10:44:23,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {1635#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1631#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:44:23,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1639#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1635#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:23,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {1643#(< (mod (+ main_~index~0 4) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1639#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:23,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1482#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1643#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:44:23,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1482#true} call #t~ret5 := main(); {1482#true} is VALID [2022-04-27 10:44:23,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1482#true} {1482#true} #71#return; {1482#true} is VALID [2022-04-27 10:44:23,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {1482#true} assume true; {1482#true} is VALID [2022-04-27 10:44:23,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1482#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(29, 2); {1482#true} is VALID [2022-04-27 10:44:23,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {1482#true} call ULTIMATE.init(); {1482#true} is VALID [2022-04-27 10:44:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:44:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380886990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:23,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:23,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:44:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201898138] [2022-04-27 10:44:23,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:23,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-27 10:44:23,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:23,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:23,443 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:44:23,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:44:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:44:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:44:23,444 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:24,823 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-04-27 10:44:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:44:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-27 10:44:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-04-27 10:44:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-04-27 10:44:24,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2022-04-27 10:44:24,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:24,938 INFO L225 Difference]: With dead ends: 107 [2022-04-27 10:44:24,938 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 10:44:24,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:44:24,939 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 147 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:24,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 60 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:44:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 10:44:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 36. [2022-04-27 10:44:24,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:24,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:24,991 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:24,991 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:24,994 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-04-27 10:44:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-04-27 10:44:24,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:24,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:24,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-27 10:44:24,994 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-27 10:44:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:24,997 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-04-27 10:44:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-04-27 10:44:24,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:24,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:24,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:24,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-27 10:44:24,998 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2022-04-27 10:44:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:24,999 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-27 10:44:24,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-27 10:44:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 10:44:24,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:24,999 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:25,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:44:25,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:25,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:25,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1390545787, now seen corresponding path program 2 times [2022-04-27 10:44:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:25,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321110006] [2022-04-27 10:44:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:25,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {2097#(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(29, 2); {2077#true} is VALID [2022-04-27 10:44:25,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:25,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2077#true} {2077#true} #71#return; {2077#true} is VALID [2022-04-27 10:44:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 10:44:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:25,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-27 10:44:25,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-27 10:44:25,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:25,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2078#false} #69#return; {2078#false} is VALID [2022-04-27 10:44:25,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:25,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {2097#(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(29, 2); {2077#true} is VALID [2022-04-27 10:44:25,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:25,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #71#return; {2077#true} is VALID [2022-04-27 10:44:25,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-27 10:44:25,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {2082#(= main_~index~0 0)} is VALID [2022-04-27 10:44:25,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2083#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:25,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {2083#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2084#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:44:25,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {2084#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2085#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:44:25,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2085#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2086#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:44:25,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {2086#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2087#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:44:25,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {2087#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2088#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:44:25,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {2088#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2089#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:44:25,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {2089#(and (<= 7 main_~index~0) (<= main_~index~0 7))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2090#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:44:25,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {2090#(and (<= 8 main_~index~0) (<= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2091#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:44:25,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {2091#(and (<= main_~index~0 9) (<= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2092#(and (<= main_~index~0 10) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {2092#(and (<= main_~index~0 10) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {2078#false} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {2078#false} ~index~0 := 0; {2078#false} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {2078#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {2078#false} assume #t~short4; {2078#false} is VALID [2022-04-27 10:44:25,453 INFO L272 TraceCheckUtils]: 20: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2077#true} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-27 10:44:25,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:25,454 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2077#true} {2078#false} #69#return; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {2078#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {2078#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {2078#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L272 TraceCheckUtils]: 29: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {2078#false} assume 0 == ~cond; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-27 10:44:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:44:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321110006] [2022-04-27 10:44:25,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321110006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066072110] [2022-04-27 10:44:25,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:44:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:25,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:25,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:44:25,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:44:25,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:44:25,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:44:25,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 10:44:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:25,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:25,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2022-04-27 10:44:25,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#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(29, 2); {2077#true} is VALID [2022-04-27 10:44:25,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:25,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #71#return; {2077#true} is VALID [2022-04-27 10:44:25,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-27 10:44:25,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {2082#(= main_~index~0 0)} is VALID [2022-04-27 10:44:25,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2083#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:25,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {2083#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2084#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:44:25,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {2084#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2085#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:44:25,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {2085#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2086#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:44:25,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {2086#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2087#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:44:25,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {2087#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2088#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:44:25,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {2088#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2089#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:44:25,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {2089#(and (<= 7 main_~index~0) (<= main_~index~0 7))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2090#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:44:25,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {2090#(and (<= 8 main_~index~0) (<= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2091#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:44:25,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {2091#(and (<= main_~index~0 9) (<= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2146#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:44:25,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {2146#(and (<= main_~index~0 10) (<= 10 main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {2078#false} is VALID [2022-04-27 10:44:25,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {2078#false} ~index~0 := 0; {2078#false} is VALID [2022-04-27 10:44:25,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {2078#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:25,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {2078#false} assume #t~short4; {2078#false} is VALID [2022-04-27 10:44:25,956 INFO L272 TraceCheckUtils]: 20: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {2078#false} assume !(0 == ~cond); {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {2078#false} assume true; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2078#false} {2078#false} #69#return; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {2078#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {2078#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {2078#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L272 TraceCheckUtils]: 29: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {2078#false} assume 0 == ~cond; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-27 10:44:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:44:25,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:26,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {2078#false} assume 0 == ~cond; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L272 TraceCheckUtils]: 29: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {2078#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {2078#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {2078#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2077#true} {2078#false} #69#return; {2078#false} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-27 10:44:26,231 INFO L272 TraceCheckUtils]: 20: Hoare triple {2078#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2077#true} is VALID [2022-04-27 10:44:26,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {2078#false} assume #t~short4; {2078#false} is VALID [2022-04-27 10:44:26,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {2078#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2078#false} is VALID [2022-04-27 10:44:26,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {2078#false} ~index~0 := 0; {2078#false} is VALID [2022-04-27 10:44:26,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {2246#(< (mod main_~index~0 4294967296) 10000)} assume !(~index~0 % 4294967296 < 10000); {2078#false} is VALID [2022-04-27 10:44:26,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2250#(< (mod (+ main_~index~0 1) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2246#(< (mod main_~index~0 4294967296) 10000)} is VALID [2022-04-27 10:44:26,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {2254#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2250#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {2258#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2254#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(< (mod (+ main_~index~0 4) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2258#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {2266#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2262#(< (mod (+ main_~index~0 4) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {2270#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2266#(< (mod (+ 5 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {2274#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2270#(< (mod (+ 6 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {2278#(< (mod (+ main_~index~0 8) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2274#(< (mod (+ 7 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2278#(< (mod (+ main_~index~0 8) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {2286#(< (mod (+ main_~index~0 10) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2282#(< (mod (+ 9 main_~index~0) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {2286#(< (mod (+ main_~index~0 10) 4294967296) 10000)} is VALID [2022-04-27 10:44:26,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-27 10:44:26,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #71#return; {2077#true} is VALID [2022-04-27 10:44:26,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-27 10:44:26,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#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(29, 2); {2077#true} is VALID [2022-04-27 10:44:26,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2022-04-27 10:44:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:44:26,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066072110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:26,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:26,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:44:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066917709] [2022-04-27 10:44:26,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:26,246 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-27 10:44:26,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:26,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:26,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:26,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:44:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:44:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:44:26,274 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:34,165 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2022-04-27 10:44:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:44:34,165 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-27 10:44:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 215 transitions. [2022-04-27 10:44:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 215 transitions. [2022-04-27 10:44:34,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 215 transitions. [2022-04-27 10:44:34,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:34,436 INFO L225 Difference]: With dead ends: 191 [2022-04-27 10:44:34,436 INFO L226 Difference]: Without dead ends: 172 [2022-04-27 10:44:34,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:44:34,437 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 583 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:34,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 108 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 10:44:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-27 10:44:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 48. [2022-04-27 10:44:34,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:34,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:34,541 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:34,541 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:34,553 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2022-04-27 10:44:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2022-04-27 10:44:34,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:34,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:34,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 172 states. [2022-04-27 10:44:34,554 INFO L87 Difference]: Start difference. First operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 172 states. [2022-04-27 10:44:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:34,559 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2022-04-27 10:44:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2022-04-27 10:44:34,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:34,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:34,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:34,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-04-27 10:44:34,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 33 [2022-04-27 10:44:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:34,561 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-04-27 10:44:34,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:44:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-27 10:44:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 10:44:34,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:34,564 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:34,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 10:44:34,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:34,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1481894533, now seen corresponding path program 3 times [2022-04-27 10:44:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:34,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255872839] [2022-04-27 10:44:34,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:34,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:35,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {3100#(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(29, 2); {3068#true} is VALID [2022-04-27 10:44:35,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-04-27 10:44:35,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3068#true} {3068#true} #71#return; {3068#true} is VALID [2022-04-27 10:44:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 10:44:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:35,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {3068#true} ~cond := #in~cond; {3068#true} is VALID [2022-04-27 10:44:35,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {3068#true} assume !(0 == ~cond); {3068#true} is VALID [2022-04-27 10:44:35,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-04-27 10:44:35,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3068#true} {3069#false} #69#return; {3069#false} is VALID [2022-04-27 10:44:35,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {3068#true} call ULTIMATE.init(); {3100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:35,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#(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(29, 2); {3068#true} is VALID [2022-04-27 10:44:35,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-04-27 10:44:35,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3068#true} {3068#true} #71#return; {3068#true} is VALID [2022-04-27 10:44:35,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {3068#true} call #t~ret5 := main(); {3068#true} is VALID [2022-04-27 10:44:35,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {3068#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {3073#(= main_~index~0 0)} is VALID [2022-04-27 10:44:35,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {3073#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3074#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-27 10:44:35,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {3074#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3075#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-27 10:44:35,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {3075#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3076#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-27 10:44:35,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {3076#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3077#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-27 10:44:35,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {3077#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3078#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-27 10:44:35,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {3078#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3079#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-27 10:44:35,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {3079#(and (<= 6 main_~index~0) (<= main_~index~0 6))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3080#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-27 10:44:35,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {3080#(and (<= 7 main_~index~0) (<= main_~index~0 7))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3081#(and (<= 8 main_~index~0) (<= main_~index~0 8))} is VALID [2022-04-27 10:44:35,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {3081#(and (<= 8 main_~index~0) (<= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3082#(and (<= main_~index~0 9) (<= 9 main_~index~0))} is VALID [2022-04-27 10:44:35,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {3082#(and (<= main_~index~0 9) (<= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3083#(and (<= main_~index~0 10) (<= 10 main_~index~0))} is VALID [2022-04-27 10:44:35,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#(and (<= main_~index~0 10) (<= 10 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3084#(and (<= main_~index~0 11) (<= 11 main_~index~0))} is VALID [2022-04-27 10:44:35,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {3084#(and (<= main_~index~0 11) (<= 11 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3085#(and (<= main_~index~0 12) (<= 12 main_~index~0))} is VALID [2022-04-27 10:44:35,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {3085#(and (<= main_~index~0 12) (<= 12 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3086#(and (<= 13 main_~index~0) (<= main_~index~0 13))} is VALID [2022-04-27 10:44:35,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {3086#(and (<= 13 main_~index~0) (<= main_~index~0 13))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3087#(and (<= 14 main_~index~0) (<= main_~index~0 14))} is VALID [2022-04-27 10:44:35,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {3087#(and (<= 14 main_~index~0) (<= main_~index~0 14))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3088#(and (<= 15 main_~index~0) (<= main_~index~0 15))} is VALID [2022-04-27 10:44:35,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {3088#(and (<= 15 main_~index~0) (<= main_~index~0 15))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3089#(and (<= main_~index~0 16) (<= 16 main_~index~0))} is VALID [2022-04-27 10:44:35,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {3089#(and (<= main_~index~0 16) (<= 16 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3090#(and (<= 17 main_~index~0) (<= main_~index~0 17))} is VALID [2022-04-27 10:44:35,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {3090#(and (<= 17 main_~index~0) (<= main_~index~0 17))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3091#(and (<= 18 main_~index~0) (<= main_~index~0 18))} is VALID [2022-04-27 10:44:35,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {3091#(and (<= 18 main_~index~0) (<= main_~index~0 18))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3092#(and (<= 19 main_~index~0) (<= main_~index~0 19))} is VALID [2022-04-27 10:44:35,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {3092#(and (<= 19 main_~index~0) (<= main_~index~0 19))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3093#(and (<= 20 main_~index~0) (<= main_~index~0 20))} is VALID [2022-04-27 10:44:35,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {3093#(and (<= 20 main_~index~0) (<= main_~index~0 20))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3094#(and (<= main_~index~0 21) (<= 21 main_~index~0))} is VALID [2022-04-27 10:44:35,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {3094#(and (<= main_~index~0 21) (<= 21 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3095#(and (<= main_~index~0 22) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {3095#(and (<= main_~index~0 22) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {3069#false} ~index~0 := 0; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {3069#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {3069#false} assume #t~short4; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L272 TraceCheckUtils]: 32: Hoare triple {3069#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3068#true} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {3068#true} ~cond := #in~cond; {3068#true} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {3068#true} assume !(0 == ~cond); {3068#true} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-04-27 10:44:35,281 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3068#true} {3069#false} #69#return; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {3069#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {3069#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {3069#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {3069#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {3069#false} is VALID [2022-04-27 10:44:35,281 INFO L272 TraceCheckUtils]: 41: Hoare triple {3069#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3069#false} is VALID [2022-04-27 10:44:35,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {3069#false} ~cond := #in~cond; {3069#false} is VALID [2022-04-27 10:44:35,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {3069#false} assume 0 == ~cond; {3069#false} is VALID [2022-04-27 10:44:35,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {3069#false} assume !false; {3069#false} is VALID [2022-04-27 10:44:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 2 proven. 253 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:44:35,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:35,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255872839] [2022-04-27 10:44:35,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255872839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:35,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094351017] [2022-04-27 10:44:35,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:44:35,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:35,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:35,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:44:35,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 10:45:20,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-27 10:45:20,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:45:20,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-27 10:45:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:20,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:45:21,040 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 19 treesize of output 15 [2022-04-27 10:45:21,091 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,160 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,216 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,263 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,314 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,366 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,416 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,472 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,520 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,573 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,623 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,683 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,736 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,792 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,846 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:21,900 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:21,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:21,956 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:21,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:22,008 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:22,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:22,059 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-27 10:45:22,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:45:22,112 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-04-27 10:45:22,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-04-27 10:45:22,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {3068#true} call ULTIMATE.init(); {3068#true} is VALID [2022-04-27 10:45:22,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {3068#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(29, 2); {3068#true} is VALID [2022-04-27 10:45:22,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-04-27 10:45:22,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3068#true} {3068#true} #71#return; {3068#true} is VALID [2022-04-27 10:45:22,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {3068#true} call #t~ret5 := main(); {3068#true} is VALID [2022-04-27 10:45:22,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {3068#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {3119#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-27 10:45:22,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {3119#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3123#(and (= (+ (- 2) main_~tmp~0) 0) (= main_~index~0 1))} is VALID [2022-04-27 10:45:22,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {3123#(and (= (+ (- 2) main_~tmp~0) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3127#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 2))} is VALID [2022-04-27 10:45:22,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {3127#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3131#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 3 main_~index~0))} is VALID [2022-04-27 10:45:22,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {3131#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3135#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {3135#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3139#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {3139#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3143#(and (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {3143#(and (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3147#(and (= 7 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {3147#(and (= 7 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3151#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 8))} is VALID [2022-04-27 10:45:22,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {3151#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 8))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3155#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 9 main_~index~0))} is VALID [2022-04-27 10:45:22,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {3155#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 9 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3159#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 10))} is VALID [2022-04-27 10:45:22,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {3159#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 10))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3163#(and (= main_~index~0 11) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {3163#(and (= main_~index~0 11) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3167#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 12))} is VALID [2022-04-27 10:45:22,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {3167#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 12))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3171#(and (= main_~index~0 13) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {3171#(and (= main_~index~0 13) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3175#(and (= 14 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {3175#(and (= 14 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3179#(and (= 15 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {3179#(and (= 15 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3183#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 16 main_~index~0))} is VALID [2022-04-27 10:45:22,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {3183#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 16 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3187#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 17))} is VALID [2022-04-27 10:45:22,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {3187#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= main_~index~0 17))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3191#(and (= main_~index~0 18) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {3191#(and (= main_~index~0 18) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3195#(and (= 19 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {3195#(and (= 19 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3199#(and (= main_~index~0 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {3199#(and (= main_~index~0 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3203#(and (= 21 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {3203#(and (= 21 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 22 main_~index~0))} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {3207#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 2) (= 22 main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {3069#false} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {3069#false} ~index~0 := 0; {3069#false} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {3069#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3069#false} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {3069#false} assume #t~short4; {3069#false} is VALID [2022-04-27 10:45:22,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {3069#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3069#false} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {3069#false} ~cond := #in~cond; {3069#false} is VALID [2022-04-27 10:45:22,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {3069#false} assume !(0 == ~cond); {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {3069#false} assume true; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3069#false} {3069#false} #69#return; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {3069#false} havoc #t~mem2;havoc #t~mem3;havoc #t~short4; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {3069#false} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {3069#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {3069#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L272 TraceCheckUtils]: 41: Hoare triple {3069#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {3069#false} ~cond := #in~cond; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {3069#false} assume 0 == ~cond; {3069#false} is VALID [2022-04-27 10:45:22,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {3069#false} assume !false; {3069#false} is VALID [2022-04-27 10:45:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:45:22,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:48:22,928 WARN L232 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:50:41,810 WARN L232 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 156 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:50:45,153 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 240 treesize of output 238