/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 10:57:39,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 10:57:39,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 10:57:39,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 10:57:39,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 10:57:39,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 10:57:39,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 10:57:39,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 10:57:39,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 10:57:39,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 10:57:39,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 10:57:39,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 10:57:39,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 10:57:39,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 10:57:39,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 10:57:39,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 10:57:39,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 10:57:39,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 10:57:39,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 10:57:39,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 10:57:39,429 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 10:57:39,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 10:57:39,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 10:57:39,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 10:57:39,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 10:57:39,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 10:57:39,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 10:57:39,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 10:57:39,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 10:57:39,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 10:57:39,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 10:57:39,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 10:57:39,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 10:57:39,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 10:57:39,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 10:57:39,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 10:57:39,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 10:57:39,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 10:57:39,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 10:57:39,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 10:57:39,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 10:57:39,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 10:57:39,438 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-07 10:57:39,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 10:57:39,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 10:57:39,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 10:57:39,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 10:57:39,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 10:57:39,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 10:57:39,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 10:57:39,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 10:57:39,459 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 10:57:39,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 10:57:39,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 10:57:39,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 10:57:39,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 10:57:39,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 10:57:39,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 10:57:39,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 10:57:39,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 10:57:39,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 10:57:39,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 10:57:39,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 10:57:39,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 10:57:39,463 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-07 10:57:39,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 10:57:39,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 10:57:39,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 10:57:39,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 10:57:39,637 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 10:57:39,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-1.c [2022-04-07 10:57:39,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24561e77c/93db8ded74e44806958b7d7ca7a68c13/FLAG92257b17b [2022-04-07 10:57:40,032 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 10:57:40,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-07 10:57:40,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24561e77c/93db8ded74e44806958b7d7ca7a68c13/FLAG92257b17b [2022-04-07 10:57:40,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24561e77c/93db8ded74e44806958b7d7ca7a68c13 [2022-04-07 10:57:40,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 10:57:40,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 10:57:40,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 10:57:40,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 10:57:40,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 10:57:40,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7b5e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40, skipping insertion in model container [2022-04-07 10:57:40,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 10:57:40,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 10:57:40,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c[320,333] [2022-04-07 10:57:40,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 10:57:40,219 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 10:57:40,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c[320,333] [2022-04-07 10:57:40,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 10:57:40,286 INFO L208 MainTranslator]: Completed translation [2022-04-07 10:57:40,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40 WrapperNode [2022-04-07 10:57:40,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 10:57:40,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 10:57:40,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 10:57:40,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 10:57:40,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 10:57:40,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 10:57:40,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 10:57:40,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 10:57:40,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (1/1) ... [2022-04-07 10:57:40,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 10:57:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 10:57:40,371 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-07 10:57:40,391 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-07 10:57:40,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 10:57:40,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 10:57:40,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 10:57:40,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 10:57:40,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 10:57:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 10:57:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 10:57:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 10:57:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 10:57:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 10:57:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 10:57:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 10:57:40,452 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 10:57:40,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 10:57:40,579 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 10:57:40,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 10:57:40,584 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 10:57:40,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:57:40 BoogieIcfgContainer [2022-04-07 10:57:40,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 10:57:40,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 10:57:40,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 10:57:40,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 10:57:40,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:57:40" (1/3) ... [2022-04-07 10:57:40,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476efc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:57:40, skipping insertion in model container [2022-04-07 10:57:40,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:57:40" (2/3) ... [2022-04-07 10:57:40,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476efc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:57:40, skipping insertion in model container [2022-04-07 10:57:40,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:57:40" (3/3) ... [2022-04-07 10:57:40,590 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-07 10:57:40,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 10:57:40,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 10:57:40,621 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 10:57:40,626 INFO L340 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 [2022-04-07 10:57:40,626 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 10:57:40,638 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-07 10:57:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 10:57:40,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 10:57:40,642 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 10:57:40,642 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 10:57:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 10:57:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-07 10:57:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 10:57:40,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611775527] [2022-04-07 10:57:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 10:57:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 10:57:40,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 10:57:40,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378710080] [2022-04-07 10:57:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 10:57:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 10:57:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 10:57:40,729 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-07 10:57:40,730 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-07 10:57:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 10:57:40,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 10:57:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 10:57:40,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 10:57:40,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-07 10:57:40,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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(11, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-07 10:57:40,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-07 10:57:40,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-07 10:57:40,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-07 10:57:40,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-07 10:57:40,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {28#false} is VALID [2022-04-07 10:57:40,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {28#false} is VALID [2022-04-07 10:57:40,880 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {28#false} is VALID [2022-04-07 10:57:40,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-07 10:57:40,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-07 10:57:40,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-07 10:57:40,881 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-07 10:57:40,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 10:57:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 10:57:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611775527] [2022-04-07 10:57:40,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 10:57:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378710080] [2022-04-07 10:57:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378710080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 10:57:40,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 10:57:40,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 10:57:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392759841] [2022-04-07 10:57:40,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 10:57:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 10:57:40,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 10:57:40,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:40,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 10:57:40,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 10:57:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 10:57:40,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 10:57:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 10:57:40,917 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 10:57:40,990 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-07 10:57:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 10:57:40,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 10:57:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 10:57:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-07 10:57:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-07 10:57:41,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-07 10:57:41,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 10:57:41,055 INFO L225 Difference]: With dead ends: 47 [2022-04-07 10:57:41,055 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 10:57:41,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 10:57:41,060 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 10:57:41,060 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 10:57:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 10:57:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-07 10:57:41,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 10:57:41,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,079 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,079 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 10:57:41,081 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-07 10:57:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-07 10:57:41,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 10:57:41,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 10:57:41,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-07 10:57:41,082 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-07 10:57:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 10:57:41,084 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-07 10:57:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-07 10:57:41,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 10:57:41,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 10:57:41,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 10:57:41,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 10:57:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-07 10:57:41,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-07 10:57:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 10:57:41,087 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-07 10:57:41,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 10:57:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 10:57:41,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 10:57:41,088 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 10:57:41,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 10:57:41,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-07 10:57:41,307 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 10:57:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 10:57:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-07 10:57:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 10:57:41,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773992635] [2022-04-07 10:57:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 10:57:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 10:57:41,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 10:57:41,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365150193] [2022-04-07 10:57:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 10:57:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 10:57:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 10:57:41,335 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-07 10:57:41,358 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-07 10:57:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 10:57:41,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 10:57:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 10:57:41,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 10:57:41,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2022-04-07 10:57:41,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#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(11, 2);call #Ultimate.allocInit(12, 3); {197#true} is VALID [2022-04-07 10:57:41,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2022-04-07 10:57:41,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #56#return; {197#true} is VALID [2022-04-07 10:57:41,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret11 := main(); {197#true} is VALID [2022-04-07 10:57:41,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {217#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-07 10:57:41,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {221#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-07 10:57:41,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {198#false} is VALID [2022-04-07 10:57:41,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {198#false} is VALID [2022-04-07 10:57:41,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {198#false} is VALID [2022-04-07 10:57:41,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {198#false} is VALID [2022-04-07 10:57:41,477 INFO L272 TraceCheckUtils]: 11: Hoare triple {198#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {198#false} is VALID [2022-04-07 10:57:41,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2022-04-07 10:57:41,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#false} assume 0 == ~cond; {198#false} is VALID [2022-04-07 10:57:41,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#false} assume !false; {198#false} is VALID [2022-04-07 10:57:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 10:57:41,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 10:57:41,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 10:57:41,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773992635] [2022-04-07 10:57:41,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 10:57:41,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365150193] [2022-04-07 10:57:41,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365150193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 10:57:41,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 10:57:41,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 10:57:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851957506] [2022-04-07 10:57:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 10:57:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 10:57:41,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 10:57:41,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 10:57:41,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 10:57:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 10:57:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 10:57:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 10:57:41,491 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 10:57:41,582 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-07 10:57:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 10:57:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 10:57:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 10:57:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-07 10:57:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-07 10:57:41,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-07 10:57:41,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 10:57:41,623 INFO L225 Difference]: With dead ends: 36 [2022-04-07 10:57:41,623 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 10:57:41,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-07 10:57:41,626 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 10:57:41,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 10:57:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 10:57:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-07 10:57:41,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 10:57:41,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,633 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,633 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 10:57:41,634 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-07 10:57:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-07 10:57:41,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 10:57:41,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 10:57:41,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-07 10:57:41,636 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-07 10:57:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 10:57:41,637 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-07 10:57:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-07 10:57:41,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 10:57:41,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 10:57:41,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 10:57:41,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 10:57:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-07 10:57:41,641 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-07 10:57:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 10:57:41,641 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-07 10:57:41,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 10:57:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 10:57:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 10:57:41,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 10:57:41,642 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 10:57:41,660 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-07 10:57:41,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-07 10:57:41,860 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 10:57:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 10:57:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-07 10:57:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 10:57:41,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128221228] [2022-04-07 10:57:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 10:57:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 10:57:41,887 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 10:57:41,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954225573] [2022-04-07 10:57:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 10:57:41,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 10:57:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 10:57:41,900 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-07 10:57:41,909 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-07 10:57:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 10:57:41,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 10:57:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 10:57:41,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 10:57:43,730 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 0 case distinctions, treesize of input 309 treesize of output 292 [2022-04-07 10:57:43,740 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-07 10:57:43,751 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-07 10:57:43,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-07 10:57:43,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-07 10:57:43,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-07 10:57:43,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#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(11, 2);call #Ultimate.allocInit(12, 3); {377#true} is VALID [2022-04-07 10:57:43,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-07 10:57:43,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #56#return; {377#true} is VALID [2022-04-07 10:57:43,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret11 := main(); {377#true} is VALID [2022-04-07 10:57:43,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {397#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-07 10:57:43,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-07 10:57:43,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-07 10:57:43,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-07 10:57:43,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-07 10:57:43,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-07 10:57:43,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-07 10:57:43,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-07 10:57:43,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {424#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-07 10:57:43,974 INFO L272 TraceCheckUtils]: 14: Hoare triple {424#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 10:57:43,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 10:57:43,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-07 10:57:43,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-07 10:57:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 10:57:43,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 10:57:45,615 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 310 treesize of output 294 [2022-04-07 10:57:45,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 10:57:45,753 INFO L244 Elim1Store]: Index analysis took 125 ms [2022-04-07 10:57:47,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-07 10:57:47,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 8 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 294 treesize of output 2671