/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:38,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:38,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:38,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:38,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:38,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:38,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:38,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:38,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:38,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:38,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:38,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:38,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:38,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:38,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:38,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:38,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:38,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:38,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:38,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:38,420 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:38,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:38,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:38,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:38,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:38,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:38,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:38,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:38,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:38,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:38,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:38,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:38,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:38,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:38,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:38,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:38,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:38,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:38,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:38,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:38,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:38,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:38,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:38,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:38,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:38,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:38,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:38,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:38,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:38,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:38,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:38,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:38,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:38,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:38,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:38,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:38,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:38,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:38,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:38,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:38,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:38,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:38,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:38,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:38,456 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,456 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:38,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:38,456 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:38,456 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:41:38,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:38,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:38,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:38,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:38,707 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:38,708 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-28 02:41:38,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8304c75c/41a2a9f2c85b4e288d8f4f38e12f3469/FLAGc1f08f387 [2022-04-28 02:41:39,148 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:39,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-28 02:41:39,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8304c75c/41a2a9f2c85b4e288d8f4f38e12f3469/FLAGc1f08f387 [2022-04-28 02:41:39,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8304c75c/41a2a9f2c85b4e288d8f4f38e12f3469 [2022-04-28 02:41:39,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:39,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:39,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:39,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:39,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:39,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142520b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39, skipping insertion in model container [2022-04-28 02:41:39,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:39,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:39,370 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-28 02:41:39,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:39,410 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:39,422 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-28 02:41:39,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:39,449 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:39,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39 WrapperNode [2022-04-28 02:41:39,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:39,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:39,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:39,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:39,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:39,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:39,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:39,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:39,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (1/1) ... [2022-04-28 02:41:39,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:39,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:41:39,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:41:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:41:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:41:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:41:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:41:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:39,641 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:39,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:39,836 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:39,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:39,842 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 02:41:39,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:39 BoogieIcfgContainer [2022-04-28 02:41:39,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:39,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:39,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:39,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:39,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:39" (1/3) ... [2022-04-28 02:41:39,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249c2729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:39, skipping insertion in model container [2022-04-28 02:41:39,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:39" (2/3) ... [2022-04-28 02:41:39,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249c2729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:39, skipping insertion in model container [2022-04-28 02:41:39,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:39" (3/3) ... [2022-04-28 02:41:39,864 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-28 02:41:39,874 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:39,875 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:39,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:39,937 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16a87215, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64d32129 [2022-04-28 02:41:39,938 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:39,950 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-28 02:41:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:41:39,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:39,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:39,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-28 02:41:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:39,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1858949524] [2022-04-28 02:41:39,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 2 times [2022-04-28 02:41:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:39,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108201885] [2022-04-28 02:41:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:40,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 02:41:40,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863254716] [2022-04-28 02:41:40,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:40,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:40,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:40,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:41:40,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 02:41:40,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:40,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:41:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:40,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:40,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-28 02:41:40,303 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-28 02:41:40,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 02:41:40,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-28 02:41:40,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-28 02:41:40,307 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-28 02:41:40,307 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-28 02:41:40,308 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-28 02:41:40,308 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-28 02:41:40,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 02:41:40,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 02:41:40,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 02:41:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:40,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:41:40,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:40,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108201885] [2022-04-28 02:41:40,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 02:41:40,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863254716] [2022-04-28 02:41:40,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863254716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:40,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:40,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:40,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1858949524] [2022-04-28 02:41:40,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1858949524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:40,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:40,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:40,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365949309] [2022-04-28 02:41:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:40,322 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-28 02:41:40,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:40,326 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-28 02:41:40,347 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-28 02:41:40,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:41:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:41:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:40,376 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-28 02:41:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:40,486 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-28 02:41:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:41:40,487 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-28 02:41:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:40,489 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-28 02:41:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-28 02:41:40,500 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-28 02:41:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-28 02:41:40,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-28 02:41:40,620 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-28 02:41:40,628 INFO L225 Difference]: With dead ends: 47 [2022-04-28 02:41:40,628 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:41:40,631 INFO L412 NwaCegarLoop]: 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-28 02:41:40,635 INFO L413 NwaCegarLoop]: 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-28 02:41:40,636 INFO L414 NwaCegarLoop]: 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-28 02:41:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:41:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-28 02:41:40,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:40,664 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-28 02:41:40,665 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-28 02:41:40,665 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-28 02:41:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:40,668 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 02:41:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 02:41:40,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:40,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:40,670 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-28 02:41:40,671 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-28 02:41:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:40,673 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 02:41:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 02:41:40,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:40,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:40,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:40,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:40,683 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-28 02:41:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 02:41:40,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-28 02:41:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:40,687 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 02:41:40,689 INFO L496 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-28 02:41:40,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 02:41:40,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:41:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:41:40,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:40,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:40,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:41:40,927 WARN L477 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-28 02:41:40,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-28 02:41:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:40,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678392837] [2022-04-28 02:41:44,906 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:41:45,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:41:45,284 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:41:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1715536111, now seen corresponding path program 1 times [2022-04-28 02:41:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:45,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130987780] [2022-04-28 02:41:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:45,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 02:41:45,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497257823] [2022-04-28 02:41:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:45,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:45,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:45,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 02:41:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:45,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:41:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:45,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:45,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-28 02:41:45,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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); {239#true} is VALID [2022-04-28 02:41:45,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-28 02:41:45,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #56#return; {239#true} is VALID [2022-04-28 02:41:45,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret11 := main(); {239#true} is VALID [2022-04-28 02:41:45,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#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; {259#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:41:45,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [60] L21-3-->L21-4_primed: Formula: (let ((.cse3 (mod v_main_~N_COL~0_4 4294967296))) (let ((.cse0 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse1 (= v_main_~k~0_9 v_main_~k~0_8)) (.cse2 (= v_main_~j~0_10 v_main_~j~0_9)) (.cse5 (< (mod v_main_~j~0_10 4294967296) .cse3)) (.cse4 (<= (mod v_main_~N_LIN~0_5 4294967296) 0))) (or (and (= v_main_~N_COL~0_4 v_main_~N_COL~0_4) .cse0 .cse1 (= v_main_~N_LIN~0_5 v_main_~N_LIN~0_5) .cse2) (and (<= (div (+ .cse3 (* (- 1) v_main_~j~0_9)) (- 4294967296)) (+ (div (+ v_main_~j~0_10 (- 4294967295)) 4294967296) 1)) .cse4 (< v_main_~j~0_10 v_main_~j~0_9) (= v_main_~k~0_8 0) .cse5) (and .cse0 .cse1 .cse2 (or (not .cse5) (not .cse4)))))) InVars {main_#t~post5=|v_main_#t~post5_4|, main_~N_COL~0=v_main_~N_COL~0_4, main_~N_LIN~0=v_main_~N_LIN~0_5, main_~k~0=v_main_~k~0_9, main_~j~0=v_main_~j~0_10} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~N_COL~0=v_main_~N_COL~0_4, main_~N_LIN~0=v_main_~N_LIN~0_5, main_~k~0=v_main_~k~0_8, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post5] {263#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:41:45,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [59] L21-4_primed-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~N_COL~0=v_main_~N_COL~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~N_COL~0=v_main_~N_COL~0_2} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-28 02:41:45,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {240#false} is VALID [2022-04-28 02:41:45,484 INFO L272 TraceCheckUtils]: 9: Hoare triple {240#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {240#false} is VALID [2022-04-28 02:41:45,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2022-04-28 02:41:45,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2022-04-28 02:41:45,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-28 02:41:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:45,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:41:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:45,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130987780] [2022-04-28 02:41:45,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 02:41:45,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497257823] [2022-04-28 02:41:45,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497257823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:45,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:45,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:45,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:45,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678392837] [2022-04-28 02:41:45,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678392837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:45,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:45,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548680447] [2022-04-28 02:41:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:45,546 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-28 02:41:45,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:45,547 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-28 02:41:45,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:45,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:41:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:41:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:41:45,561 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-28 02:41:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:45,647 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-28 02:41:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:41:45,647 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-28 02:41:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:45,648 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-28 02:41:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 02:41:45,650 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-28 02:41:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 02:41:45,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-28 02:41:45,699 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-28 02:41:45,701 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:41:45,702 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:41:45,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:41:45,709 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:45,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:41:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-28 02:41:45,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:45,715 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-28 02:41:45,716 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-28 02:41:45,716 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-28 02:41:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:45,718 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-28 02:41:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 02:41:45,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:45,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:45,719 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-28 02:41:45,719 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-28 02:41:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:45,721 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-28 02:41:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 02:41:45,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:45,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:45,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:45,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:45,723 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-28 02:41:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 02:41:45,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 02:41:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:45,724 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 02:41:45,724 INFO L496 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-28 02:41:45,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 02:41:45,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:41:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:41:45,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:45,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:45,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 02:41:45,959 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,SelfDestructingSolverStorable1 [2022-04-28 02:41:45,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-28 02:41:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [426148634] [2022-04-28 02:41:54,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:54,872 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:55,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:55,159 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:55,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 2 times [2022-04-28 02:41:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:55,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124164946] [2022-04-28 02:41:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:55,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 02:41:55,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738477853] [2022-04-28 02:41:55,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:55,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:55,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:41:55,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 02:41:55,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:55,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:55,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:41:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:55,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:55,651 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 26 treesize of output 22 [2022-04-28 02:41:56,072 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-28 02:41:56,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2022-04-28 02:41:56,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#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); {442#true} is VALID [2022-04-28 02:41:56,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2022-04-28 02:41:56,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #56#return; {442#true} is VALID [2022-04-28 02:41:56,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret11 := main(); {442#true} is VALID [2022-04-28 02:41:56,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#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; {462#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:41:56,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(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; {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:41:56,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(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); {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:41:56,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(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; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:41:56,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(<= (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; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:41:56,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:41:56,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(<= (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; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:41:56,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:41:56,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= (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); {489#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 02:41:56,155 INFO L272 TraceCheckUtils]: 14: Hoare triple {489#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {493#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:56,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {497#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:56,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {443#false} is VALID [2022-04-28 02:41:56,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#false} assume !false; {443#false} is VALID [2022-04-28 02:41:56,157 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-28 02:41:56,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:58,093 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 26 treesize of output 24 [2022-04-28 02:41:58,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:58,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-28 02:41:58,130 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 28 treesize of output 26 [2022-04-28 02:41:58,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:58,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-04-28 02:41:58,163 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-28 02:41:58,184 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 29 treesize of output 27 [2022-04-28 02:41:58,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:58,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-28 02:41:58,350 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 24 treesize of output 22 [2022-04-28 02:41:58,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:58,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-28 02:41:58,560 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 26 treesize of output 24 [2022-04-28 02:41:58,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:58,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-28 02:41:58,786 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 27 treesize of output 25 [2022-04-28 02:41:58,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:58,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 02:41:59,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:59,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-04-28 02:41:59,486 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-28 02:41:59,795 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-04-28 02:41:59,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 3 [2022-04-28 02:41:59,823 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-28 02:41:59,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 3 [2022-04-28 02:41:59,879 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-04-28 02:41:59,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 3 [2022-04-28 02:41:59,979 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-04-28 02:41:59,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-04-28 02:42:00,135 INFO L356 Elim1Store]: treesize reduction 6, result has 73.9 percent of original size [2022-04-28 02:42:00,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-28 02:42:03,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#false} assume !false; {443#false} is VALID [2022-04-28 02:42:03,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {443#false} is VALID [2022-04-28 02:42:03,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {497#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:03,161 INFO L272 TraceCheckUtils]: 14: Hoare triple {489#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {493#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:03,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= (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); {489#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 02:42:03,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:03,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(<= (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; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:03,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:03,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(<= (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; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:03,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {531#(and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|)))) (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))))) (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|))))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (mod main_~k~0 4294967296) 2147483647) (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (- 17179869184) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (not (<= (mod main_~N_LIN~0 4294967296) 2147483647))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))))))} 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; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:03,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {535#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (<= (mod main_~k~0 4294967296) 2147483647)))))} 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); {531#(and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|)))) (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))))) (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|))))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (mod main_~k~0 4294967296) 2147483647) (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (- 17179869184) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (not (<= (mod main_~N_LIN~0 4294967296) 2147483647))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))))))} is VALID [2022-04-28 02:42:03,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {539#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (not (< 0 (mod main_~N_LIN~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {535#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (<= (mod main_~k~0 4294967296) 2147483647)))))} is VALID [2022-04-28 02:42:03,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#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; {539#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (not (< 0 (mod main_~N_LIN~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-28 02:42:03,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret11 := main(); {442#true} is VALID [2022-04-28 02:42:03,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #56#return; {442#true} is VALID [2022-04-28 02:42:03,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2022-04-28 02:42:03,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#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); {442#true} is VALID [2022-04-28 02:42:03,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2022-04-28 02:42:03,297 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-28 02:42:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124164946] [2022-04-28 02:42:03,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 02:42:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738477853] [2022-04-28 02:42:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738477853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:03,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 02:42:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-28 02:42:03,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [426148634] [2022-04-28 02:42:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [426148634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:03,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:03,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710837583] [2022-04-28 02:42:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-28 02:42:03,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:03,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:03,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:03,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:42:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:03,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:42:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:42:03,334 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:03,670 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 02:42:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:42:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-28 02:42:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 02:42:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 02:42:03,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-28 02:42:03,717 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-28 02:42:03,718 INFO L225 Difference]: With dead ends: 37 [2022-04-28 02:42:03,718 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 02:42:03,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:42:03,719 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:03,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 02:42:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-28 02:42:03,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:03,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-28 02:42:03,733 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-28 02:42:03,733 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-28 02:42:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:03,736 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 02:42:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 02:42:03,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:03,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:03,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 31 states. [2022-04-28 02:42:03,737 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 31 states. [2022-04-28 02:42:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:03,739 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 02:42:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 02:42:03,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:03,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:03,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:03,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-28 02:42:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-28 02:42:03,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-04-28 02:42:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:03,743 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-28 02:42:03,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:03,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-28 02:42:03,771 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-28 02:42:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 02:42:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:42:03,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:03,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:03,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:03,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 1 times [2022-04-28 02:42:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420932373] [2022-04-28 02:42:10,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:10,487 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:10,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:10,760 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:10,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 2 times [2022-04-28 02:42:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:10,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922039447] [2022-04-28 02:42:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:10,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 02:42:10,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634814902] [2022-04-28 02:42:10,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:10,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:42:10,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 02:42:10,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:10,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:10,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:42:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:10,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:11,261 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-28 02:42:11,352 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-28 02:42:11,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2022-04-28 02:42:11,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#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); {754#true} is VALID [2022-04-28 02:42:11,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2022-04-28 02:42:11,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #56#return; {754#true} is VALID [2022-04-28 02:42:11,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret11 := main(); {754#true} is VALID [2022-04-28 02:42:11,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#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; {774#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:42:11,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(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; {778#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:42:11,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#(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); {782#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} is VALID [2022-04-28 02:42:11,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:11,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(< (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; {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:11,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:11,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(< (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; {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:11,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:42:11,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(< (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); {802#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 02:42:11,442 INFO L272 TraceCheckUtils]: 14: Hoare triple {802#(< |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:11,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:11,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {755#false} is VALID [2022-04-28 02:42:11,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#false} assume !false; {755#false} is VALID [2022-04-28 02:42:11,443 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-28 02:42:11,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:12,081 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 28 treesize of output 26 [2022-04-28 02:42:12,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-04-28 02:42:12,201 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 26 treesize of output 24 [2022-04-28 02:42:12,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-28 02:42:12,276 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 27 treesize of output 25 [2022-04-28 02:42:12,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 02:42:12,310 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 29 treesize of output 27 [2022-04-28 02:42:12,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-28 02:42:12,355 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 25 treesize of output 23 [2022-04-28 02:42:12,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-28 02:42:12,391 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 27 treesize of output 25 [2022-04-28 02:42:12,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 02:42:12,563 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 26 treesize of output 24 [2022-04-28 02:42:12,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-28 02:42:12,717 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 24 treesize of output 22 [2022-04-28 02:42:12,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:12,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-28 02:42:21,134 WARN L232 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 181 DAG size of output: 117 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-28 02:42:21,177 INFO L356 Elim1Store]: treesize reduction 1065, result has 24.4 percent of original size [2022-04-28 02:42:21,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 294 treesize of output 479 [2022-04-28 02:46:27,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#false} assume !false; {755#false} is VALID [2022-04-28 02:46:27,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {755#false} is VALID [2022-04-28 02:46:27,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:46:27,784 INFO L272 TraceCheckUtils]: 14: Hoare triple {826#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:46:27,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(<= (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); {826#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 02:46:27,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:46:27,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#(<= (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; {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:46:27,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:46:27,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(<= (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; {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:46:27,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {846#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 02:46:27,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (or (= 17179869184 (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (mod main_~j~0 4294967296) 2147483647)) (or (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)))))) (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647)) (or (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647)) (or (< 2147483647 (mod main_~k~0 4294967296)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296)))))))} 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); {846#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} is VALID [2022-04-28 02:46:27,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (= (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {850#(and (or (= 17179869184 (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (mod main_~j~0 4294967296) 2147483647)) (or (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)))))) (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647)) (or (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647)) (or (< 2147483647 (mod main_~k~0 4294967296)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296)))))))} is VALID [2022-04-28 02:46:27,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#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; {854#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (= (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-28 02:46:27,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret11 := main(); {754#true} is VALID [2022-04-28 02:46:27,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #56#return; {754#true} is VALID [2022-04-28 02:46:27,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2022-04-28 02:46:27,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#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); {754#true} is VALID [2022-04-28 02:46:27,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2022-04-28 02:46:27,811 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-28 02:46:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:46:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922039447] [2022-04-28 02:46:27,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 02:46:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634814902] [2022-04-28 02:46:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634814902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:46:27,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 02:46:27,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 02:46:27,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:46:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420932373] [2022-04-28 02:46:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420932373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:46:27,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:46:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:46:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617707431] [2022-04-28 02:46:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:46:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 18 [2022-04-28 02:46:27,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:46:27,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:27,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:46:27,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:46:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:46:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:46:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:46:27,839 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:46:28,632 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-28 02:46:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:46:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 18 [2022-04-28 02:46:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:46:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-28 02:46:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-28 02:46:28,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2022-04-28 02:46:28,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:46:28,686 INFO L225 Difference]: With dead ends: 43 [2022-04-28 02:46:28,686 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 02:46:28,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:46:28,687 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:46:28,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:46:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 02:46:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-04-28 02:46:28,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:46:28,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-28 02:46:28,698 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-28 02:46:28,698 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-28 02:46:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:46:28,700 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 02:46:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 02:46:28,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:46:28,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:46:28,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 37 states. [2022-04-28 02:46:28,701 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 37 states. [2022-04-28 02:46:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:46:28,702 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 02:46:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-28 02:46:28,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:46:28,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:46:28,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:46:28,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:46:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-28 02:46:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-28 02:46:28,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 18 [2022-04-28 02:46:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:46:28,704 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-28 02:46:28,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:28,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-28 02:46:28,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:46:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 02:46:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:46:28,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:46:28,753 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:46:28,769 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-28 02:46:28,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:46:28,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:46:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:46:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 867522333, now seen corresponding path program 3 times [2022-04-28 02:46:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:46:28,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177849616] [2022-04-28 02:46:41,829 WARN L232 SmtUtils]: Spent 9.12s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 02:46:51,995 WARN L232 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 02:46:52,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:46:52,021 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:46:52,677 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:46:52,677 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:46:52,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:46:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 867522333, now seen corresponding path program 4 times [2022-04-28 02:46:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:46:52,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450536376] [2022-04-28 02:46:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:46:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:46:52,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 02:46:52,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926353469] [2022-04-28 02:46:52,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:46:52,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:46:52,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:46:52,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:46:52,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:46:52,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:46:52,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:46:52,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:46:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:46:52,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:46:52,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1105#true} call ULTIMATE.init(); {1105#true} is VALID [2022-04-28 02:46:52,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#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); {1105#true} is VALID [2022-04-28 02:46:52,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-04-28 02:46:52,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1105#true} {1105#true} #56#return; {1105#true} is VALID [2022-04-28 02:46:52,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1105#true} call #t~ret11 := main(); {1105#true} is VALID [2022-04-28 02:46:52,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#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; {1125#(= main_~N_LIN~0 1)} is VALID [2022-04-28 02:46:52,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1125#(= main_~N_LIN~0 1)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:46:52,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1129#(and (= main_~k~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); {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:46:52,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1129#(and (= main_~k~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; {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:46:52,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1139#(and (= main_~k~0 1) (= main_~N_LIN~0 1))} is VALID [2022-04-28 02:46:52,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1139#(and (= main_~k~0 1) (= 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); {1106#false} is VALID [2022-04-28 02:46:52,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#false} 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; {1106#false} is VALID [2022-04-28 02:46:52,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1106#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1106#false} is VALID [2022-04-28 02:46:52,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {1106#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1106#false} is VALID [2022-04-28 02:46:52,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1106#false} is VALID [2022-04-28 02:46:52,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1106#false} is VALID [2022-04-28 02:46:52,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {1106#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1106#false} is VALID [2022-04-28 02:46:52,873 INFO L272 TraceCheckUtils]: 17: Hoare triple {1106#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1106#false} is VALID [2022-04-28 02:46:52,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {1106#false} ~cond := #in~cond; {1106#false} is VALID [2022-04-28 02:46:52,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1106#false} assume 0 == ~cond; {1106#false} is VALID [2022-04-28 02:46:52,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-04-28 02:46:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:46:52,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:46:52,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-04-28 02:46:52,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {1106#false} assume 0 == ~cond; {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1106#false} ~cond := #in~cond; {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L272 TraceCheckUtils]: 17: Hoare triple {1106#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {1106#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1106#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1106#false} is VALID [2022-04-28 02:46:52,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {1106#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1106#false} is VALID [2022-04-28 02:46:52,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#false} 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; {1106#false} is VALID [2022-04-28 02:46:52,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {1203#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} 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); {1106#false} is VALID [2022-04-28 02:46:52,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1203#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 02:46:52,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} 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; {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 02:46:52,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} 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); {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 02:46:52,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1217#(not (< 1 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 02:46:52,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#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; {1217#(not (< 1 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 02:46:52,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1105#true} call #t~ret11 := main(); {1105#true} is VALID [2022-04-28 02:46:52,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1105#true} {1105#true} #56#return; {1105#true} is VALID [2022-04-28 02:46:52,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-04-28 02:46:52,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#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); {1105#true} is VALID [2022-04-28 02:46:52,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {1105#true} call ULTIMATE.init(); {1105#true} is VALID [2022-04-28 02:46:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:46:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:46:52,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450536376] [2022-04-28 02:46:52,973 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 02:46:52,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926353469] [2022-04-28 02:46:52,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926353469] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:46:52,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 02:46:52,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 02:46:52,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:46:52,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177849616] [2022-04-28 02:46:52,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177849616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:46:52,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:46:52,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:46:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789321367] [2022-04-28 02:46:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:46:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2022-04-28 02:46:52,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:46:52,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:53,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:46:53,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:46:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:46:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:46:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:46:53,001 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:46:53,062 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-28 02:46:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:46:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2022-04-28 02:46:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:46:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 02:46:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 02:46:53,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 02:46:53,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:46:53,097 INFO L225 Difference]: With dead ends: 45 [2022-04-28 02:46:53,097 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:46:53,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:46:53,098 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:46:53,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:46:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:46:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 02:46:53,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:46:53,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:46:53,107 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:46:53,108 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:46:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:46:53,109 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:46:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:46:53,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:46:53,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:46:53,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-28 02:46:53,109 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-28 02:46:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:46:53,111 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:46:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:46:53,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:46:53,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:46:53,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:46:53,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:46:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:46:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 02:46:53,112 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-28 02:46:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:46:53,112 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 02:46:53,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:46:53,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 02:46:53,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:46:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:46:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:46:53,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:46:53,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:46:53,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 02:46:53,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:46:53,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:46:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:46:53,361 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 5 times [2022-04-28 02:46:53,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:46:53,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464261550] [2022-04-28 02:47:03,338 WARN L232 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 02:47:03,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:03,414 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:05,738 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:47:05,738 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:47:05,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:47:05,738 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 6 times [2022-04-28 02:47:05,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:47:05,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020709866] [2022-04-28 02:47:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:47:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:47:05,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 02:47:05,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497048468] [2022-04-28 02:47:05,756 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:47:05,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:05,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:47:05,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:47:05,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:47:05,812 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 02:47:05,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:47:05,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:47:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:47:05,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:47:05,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2022-04-28 02:47:05,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#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); {1430#true} is VALID [2022-04-28 02:47:05,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-28 02:47:05,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #56#return; {1430#true} is VALID [2022-04-28 02:47:05,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret11 := main(); {1430#true} is VALID [2022-04-28 02:47:05,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#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; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:47:05,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:47:05,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} 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); {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:47:05,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} 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; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:47:05,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:47:05,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 02:47:05,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1469#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} is VALID [2022-04-28 02:47:05,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1469#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1431#false} is VALID [2022-04-28 02:47:05,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1431#false} 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); {1431#false} is VALID [2022-04-28 02:47:05,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} 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; {1431#false} is VALID [2022-04-28 02:47:05,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1431#false} is VALID [2022-04-28 02:47:05,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {1431#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {1431#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {1431#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L272 TraceCheckUtils]: 20: Hoare triple {1431#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-28 02:47:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 02:47:05,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:47:05,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-28 02:47:05,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-28 02:47:05,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-28 02:47:05,988 INFO L272 TraceCheckUtils]: 20: Hoare triple {1431#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1431#false} is VALID [2022-04-28 02:47:05,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {1431#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1431#false} is VALID [2022-04-28 02:47:05,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {1431#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1431#false} is VALID [2022-04-28 02:47:05,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {1431#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1431#false} is VALID [2022-04-28 02:47:05,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1431#false} is VALID [2022-04-28 02:47:05,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1431#false} is VALID [2022-04-28 02:47:05,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} 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; {1431#false} is VALID [2022-04-28 02:47:05,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {1431#false} 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); {1431#false} is VALID [2022-04-28 02:47:05,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1431#false} is VALID [2022-04-28 02:47:05,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1539#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} 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; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} 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); {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#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; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 02:47:05,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret11 := main(); {1430#true} is VALID [2022-04-28 02:47:05,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #56#return; {1430#true} is VALID [2022-04-28 02:47:05,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-28 02:47:05,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#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); {1430#true} is VALID [2022-04-28 02:47:05,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2022-04-28 02:47:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 02:47:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:47:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020709866] [2022-04-28 02:47:05,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 02:47:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497048468] [2022-04-28 02:47:05,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497048468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:47:05,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 02:47:05,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 02:47:05,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:47:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464261550] [2022-04-28 02:47:05,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464261550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:47:05,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:47:05,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:47:05,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432208690] [2022-04-28 02:47:05,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:47:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 24 [2022-04-28 02:47:05,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:47:05,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:06,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:06,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:47:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:47:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:47:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:47:06,027 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:06,067 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 02:47:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:47:06,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 24 [2022-04-28 02:47:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:47:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 02:47:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 02:47:06,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-28 02:47:06,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:06,107 INFO L225 Difference]: With dead ends: 25 [2022-04-28 02:47:06,107 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:47:06,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:47:06,108 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 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-28 02:47:06,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:47:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:47:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:47:06,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:47:06,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:47:06,109 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:47:06,109 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:47:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:06,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:47:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:47:06,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:06,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:06,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:47:06,110 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:47:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:47:06,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:47:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:47:06,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:06,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:47:06,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:47:06,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:47:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:47:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:47:06,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 02:47:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:47:06,111 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:47:06,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:47:06,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:47:06,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:47:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:47:06,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:47:06,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:47:06,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 02:47:06,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:47:06,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:47:06,496 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 02:47:06,496 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 02:47:06,496 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 02:47:06,496 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 13 33) the Hoare annotation is: true [2022-04-28 02:47:06,496 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 28) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~k~0 1) (= main_~N_LIN~0 1)) [2022-04-28 02:47:06,496 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 28) the Hoare annotation is: (let ((.cse0 (= main_~N_COL~0 1)) (.cse1 (= main_~N_LIN~0 1))) (or (and .cse0 (= main_~j~0 0) .cse1) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~j~0 1) .cse0 (= main_~k~0 1) .cse1))) [2022-04-28 02:47:06,496 INFO L895 garLoopResultBuilder]: At program point L21-4(lines 21 28) the Hoare annotation is: (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) [2022-04-28 02:47:06,496 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 13 33) the Hoare annotation is: true [2022-04-28 02:47:06,496 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (<= |main_#t~mem10| main_~maior~0)) [2022-04-28 02:47:06,496 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L895 garLoopResultBuilder]: At program point L26(lines 26 27) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|) (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1)) [2022-04-28 02:47:06,497 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 28) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1)) [2022-04-28 02:47:06,497 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 28) the Hoare annotation is: (let ((.cse0 (= main_~N_COL~0 1)) (.cse1 (= main_~j~0 0)) (.cse2 (= main_~N_LIN~0 1))) (or (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 .cse1 (= main_~k~0 1) .cse2) (and (= main_~k~0 0) .cse0 .cse1 .cse2))) [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 02:47:06,497 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 02:47:06,497 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 02:47:06,497 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 02:47:06,499 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1] [2022-04-28 02:47:06,500 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:47:06,503 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:47:06,516 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:47:06,535 INFO L163 areAnnotationChecker]: CFG has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:47:06,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:47:06 BoogieIcfgContainer [2022-04-28 02:47:06,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:47:06,545 INFO L158 Benchmark]: Toolchain (without parser) took 327373.50ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 142.1MB in the beginning and 144.8MB in the end (delta: -2.8MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2022-04-28 02:47:06,546 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:47:06,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.82ms. Allocated memory is still 190.8MB. Free memory was 141.9MB in the beginning and 166.1MB in the end (delta: -24.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 02:47:06,546 INFO L158 Benchmark]: Boogie Preprocessor took 53.60ms. Allocated memory is still 190.8MB. Free memory was 166.1MB in the beginning and 164.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:47:06,546 INFO L158 Benchmark]: RCFGBuilder took 337.56ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 151.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 02:47:06,547 INFO L158 Benchmark]: TraceAbstraction took 326699.34ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 150.8MB in the beginning and 144.8MB in the end (delta: 5.9MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. [2022-04-28 02:47:06,548 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.82ms. Allocated memory is still 190.8MB. Free memory was 141.9MB in the beginning and 166.1MB in the end (delta: -24.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.60ms. Allocated memory is still 190.8MB. Free memory was 166.1MB in the beginning and 164.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 337.56ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 151.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 326699.34ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 150.8MB in the beginning and 144.8MB in the end (delta: 5.9MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 326.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 83 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 80 NumberOfFragments, 173 HoareAnnotationTreeSize, 54 FomulaSimplifications, 113 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && N_COL == 1) && j == 0) && k == 1) && N_LIN == 1) || (((k == 0 && N_COL == 1) && j == 0) && N_LIN == 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((N_COL == 1 && j == 0) && N_LIN == 1) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && j == 1) && N_COL == 1) && k == 1) && N_LIN == 1) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:47:06,775 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-28 02:47:06,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...