/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:02:09,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:02:09,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:02:09,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:02:09,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:02:09,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:02:09,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:02:09,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:02:09,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:02:09,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:02:09,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:02:09,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:02:09,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:02:09,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:02:09,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:02:09,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:02:09,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:02:09,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:02:09,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:02:09,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:02:09,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:02:09,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:02:09,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:02:09,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:02:09,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:02:09,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:02:09,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:02:09,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:02:09,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:02:09,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:02:09,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:02:09,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:02:09,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:02:09,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:02:09,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:02:09,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:02:09,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:02:09,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:02:09,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:02:09,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:02:09,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:02:09,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:02:09,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:02:09,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:02:09,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:02:09,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:02:09,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:02:09,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:02:09,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:02:09,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:02:09,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:02:09,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:02:09,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:02:09,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:02:09,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:02:09,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:02:09,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:02:09,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:02:09,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:02:09,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:02:09,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:02:09,407 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:02:09,407 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:02:09,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:02:09,407 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:02:09,407 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:02:09,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:02:09,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:02:09,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:02:09,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:02:09,638 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:02:09,639 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-15 12:02:09,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a802960/35f9248ad5c14e4ea6feff8f0659a20c/FLAGad88501aa [2022-04-15 12:02:10,109 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:02:10,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-15 12:02:10,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a802960/35f9248ad5c14e4ea6feff8f0659a20c/FLAGad88501aa [2022-04-15 12:02:10,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a802960/35f9248ad5c14e4ea6feff8f0659a20c [2022-04-15 12:02:10,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:02:10,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:02:10,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:02:10,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:02:10,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:02:10,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec323fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10, skipping insertion in model container [2022-04-15 12:02:10,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:02:10,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:02:10,269 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-15 12:02:10,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:02:10,299 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:02:10,315 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-15 12:02:10,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:02:10,336 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:02:10,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10 WrapperNode [2022-04-15 12:02:10,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:02:10,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:02:10,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:02:10,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:02:10,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:02:10,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:02:10,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:02:10,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:02:10,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (1/1) ... [2022-04-15 12:02:10,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:02:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:10,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:02:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:02:10,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:02:10,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:02:10,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:02:10,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:02:10,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:02:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:02:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:02:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:02:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:02:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:02:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:02:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:02:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:02:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:02:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:02:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:02:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:02:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:02:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:02:10,480 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:02:10,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:02:10,608 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:02:10,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:02:10,614 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:02:10,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:02:10 BoogieIcfgContainer [2022-04-15 12:02:10,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:02:10,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:02:10,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:02:10,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:02:10,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:02:10" (1/3) ... [2022-04-15 12:02:10,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554f6d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:02:10, skipping insertion in model container [2022-04-15 12:02:10,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:10" (2/3) ... [2022-04-15 12:02:10,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554f6d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:02:10, skipping insertion in model container [2022-04-15 12:02:10,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:02:10" (3/3) ... [2022-04-15 12:02:10,652 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-15 12:02:10,658 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:02:10,658 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:02:10,701 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:02:10,705 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:02:10,706 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:02:10,725 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-15 12:02:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:02:10,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:10,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:10,730 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-15 12:02:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:10,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425371904] [2022-04-15 12:02:10,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:02:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 2 times [2022-04-15 12:02:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:10,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224691225] [2022-04-15 12:02:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:10,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:10,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056404491] [2022-04-15 12:02:10,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:10,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:10,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:10,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:10,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:02:10,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:02:10,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:10,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:02:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:10,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:11,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-15 12:02:11,032 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-15 12:02:11,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:02:11,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-15 12:02:11,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-15 12:02:11,034 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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 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-15 12:02:11,034 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-15 12:02:11,034 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-15 12:02:11,034 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-15 12:02:11,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 12:02:11,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:02:11,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:02:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:11,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:02:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:11,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224691225] [2022-04-15 12:02:11,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:02:11,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056404491] [2022-04-15 12:02:11,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056404491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:11,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:11,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:02:11,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425371904] [2022-04-15 12:02:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425371904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:11,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:11,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:02:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915408413] [2022-04-15 12:02:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:11,047 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-15 12:02:11,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:11,050 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-15 12:02:11,069 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-15 12:02:11,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:02:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:11,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:02:11,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:02:11,095 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-15 12:02:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,166 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-15 12:02:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:02:11,167 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-15 12:02:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:11,168 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-15 12:02:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 12:02:11,173 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-15 12:02:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 12:02:11,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-15 12:02:11,239 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-15 12:02:11,247 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:02:11,247 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:02:11,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:02:11,254 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:11,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:02:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:02:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-15 12:02:11,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:11,282 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-15 12:02:11,283 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-15 12:02:11,284 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-15 12:02:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,286 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:02:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 12:02:11,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:11,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:11,287 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-15 12:02:11,288 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-15 12:02:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:11,295 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:02:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 12:02:11,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:11,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:11,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:11,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:11,297 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-15 12:02:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 12:02:11,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-15 12:02:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:11,306 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 12:02:11,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:11,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 12:02:11,322 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-15 12:02:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:02:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:02:11,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:11,323 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:11,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:11,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 12:02:11,532 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-15 12:02:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:11,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401004035] [2022-04-15 12:02:11,690 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:02:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1715536111, now seen corresponding path program 1 times [2022-04-15 12:02:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:11,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374372990] [2022-04-15 12:02:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:11,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:11,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711520897] [2022-04-15 12:02:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:11,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:11,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:02:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:02:11,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:02:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:02:11,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:02:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 2 times [2022-04-15 12:02:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50345988] [2022-04-15 12:02:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:11,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:11,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782704451] [2022-04-15 12:02:11,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:11,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:11,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:11,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:02:11,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:11,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:11,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:02:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:11,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:11,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-15 12:02:11,997 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-15 12:02:11,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-15 12:02:11,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #56#return; {239#true} is VALID [2022-04-15 12:02:11,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret11 := main(); {239#true} is VALID [2022-04-15 12:02:12,000 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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 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-15 12:02:12,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(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; {263#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:12,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {240#false} is VALID [2022-04-15 12:02:12,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {240#false} is VALID [2022-04-15 12:02:12,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {240#false} is VALID [2022-04-15 12:02:12,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {240#false} is VALID [2022-04-15 12:02:12,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {240#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {240#false} is VALID [2022-04-15 12:02:12,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2022-04-15 12:02:12,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2022-04-15 12:02:12,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-15 12:02:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:02:12,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:02:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:12,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50345988] [2022-04-15 12:02:12,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:02:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782704451] [2022-04-15 12:02:12,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782704451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:12,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:12,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:02:12,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401004035] [2022-04-15 12:02:12,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401004035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:12,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:12,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:02:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493106335] [2022-04-15 12:02:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:12,008 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-15 12:02:12,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:12,009 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-15 12:02:12,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:12,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:02:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:02:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:02:12,026 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-15 12:02:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,106 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 12:02:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:02:12,107 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-15 12:02:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:12,108 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-15 12:02:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-15 12:02:12,110 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-15 12:02:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-15 12:02:12,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-15 12:02:12,143 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-15 12:02:12,146 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:02:12,146 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:02:12,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:02:12,153 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:12,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:02:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:02:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-15 12:02:12,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:12,161 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-15 12:02:12,162 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-15 12:02:12,162 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-15 12:02:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,163 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 12:02:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 12:02:12,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:12,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:12,164 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-15 12:02:12,165 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-15 12:02:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:12,167 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 12:02:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 12:02:12,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:12,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:12,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:12,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:12,171 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-15 12:02:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:02:12,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:02:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:12,178 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:02:12,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:02:12,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:02:12,197 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-15 12:02:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:02:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:02:12,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:12,199 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:12,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:12,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 12:02:12,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:12,614 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-15 12:02:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:12,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751650393] [2022-04-15 12:02:12,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:12,735 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:12,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 2 times [2022-04-15 12:02:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496768802] [2022-04-15 12:02:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:12,762 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:12,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542615657] [2022-04-15 12:02:12,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:12,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:12,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:12,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:12,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:02:12,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:12,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:12,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:02:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:12,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:12,944 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-15 12:02:13,010 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-15 12:02:13,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-15 12:02:13,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#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); {449#true} is VALID [2022-04-15 12:02:13,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-15 12:02:13,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #56#return; {449#true} is VALID [2022-04-15 12:02:13,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret11 := main(); {449#true} is VALID [2022-04-15 12:02:13,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {469#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:13,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(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; {473#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:13,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {473#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {473#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:13,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(<= (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; {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= (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; {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= (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); {496#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 12:02:13,079 INFO L272 TraceCheckUtils]: 14: Hoare triple {496#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:13,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:13,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-04-15 12:02:13,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-15 12:02:13,081 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-15 12:02:13,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:13,236 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-15 12:02:13,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-04-15 12:02:13,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-15 12:02:13,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-04-15 12:02:13,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:13,322 INFO L272 TraceCheckUtils]: 14: Hoare triple {496#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:13,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= (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); {496#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 12:02:13,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= (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; {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(<= (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; {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#(<= (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|)))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {480#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:13,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) 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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {538#(<= (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|)))} is VALID [2022-04-15 12:02:13,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {546#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) 0) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {542#(= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) 0)} is VALID [2022-04-15 12:02:13,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {546#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) 0) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-15 12:02:13,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret11 := main(); {449#true} is VALID [2022-04-15 12:02:13,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #56#return; {449#true} is VALID [2022-04-15 12:02:13,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-15 12:02:13,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#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); {449#true} is VALID [2022-04-15 12:02:13,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-15 12:02:13,332 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-15 12:02:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:13,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496768802] [2022-04-15 12:02:13,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:02:13,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542615657] [2022-04-15 12:02:13,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542615657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:13,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:02:13,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-15 12:02:13,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751650393] [2022-04-15 12:02:13,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751650393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:13,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:13,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:02:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137500594] [2022-04-15 12:02:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:13,336 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-15 12:02:13,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:13,338 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-15 12:02:13,350 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-15 12:02:13,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:02:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:02:13,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:02:13,351 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-15 12:02:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:13,585 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 12:02:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:02:13,585 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-15 12:02:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:13,585 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-15 12:02:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 12:02:13,587 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-15 12:02:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 12:02:13,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-15 12:02:13,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:13,622 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:02:13,623 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:02:13,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:02:13,624 INFO L913 BasicCegarLoop]: 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-15 12:02:13,624 INFO L914 BasicCegarLoop]: 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-15 12:02:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:02:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-15 12:02:13,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:13,630 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-15 12:02:13,630 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-15 12:02:13,630 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-15 12:02:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:13,631 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 12:02:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 12:02:13,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:13,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:13,632 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-15 12:02:13,632 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-15 12:02:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:13,633 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 12:02:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 12:02:13,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:13,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:13,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:13,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:13,634 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-15 12:02:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 12:02:13,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-04-15 12:02:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:13,635 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 12:02:13,635 INFO L479 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-15 12:02:13,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 12:02:13,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 12:02:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:02:13,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:13,669 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:13,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:13,870 WARN L460 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-15 12:02:13,870 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 1 times [2022-04-15 12:02:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779531467] [2022-04-15 12:02:13,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:13,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:13,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 2 times [2022-04-15 12:02:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:13,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456094666] [2022-04-15 12:02:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:13,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:13,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855074469] [2022-04-15 12:02:13,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:13,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:13,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:02:14,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:14,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:14,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:02:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:14,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:14,134 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-15 12:02:14,191 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-15 12:02:14,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2022-04-15 12:02:14,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#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); {761#true} is VALID [2022-04-15 12:02:14,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {761#true} assume true; {761#true} is VALID [2022-04-15 12:02:14,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {761#true} {761#true} #56#return; {761#true} is VALID [2022-04-15 12:02:14,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {761#true} call #t~ret11 := main(); {761#true} is VALID [2022-04-15 12:02:14,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {781#(= main_~j~0 0)} is VALID [2022-04-15 12:02:14,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {785#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-15 12:02:14,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {785#(and (= main_~k~0 0) (= 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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {789#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} is VALID [2022-04-15 12:02:14,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {789#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:14,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {793#(< (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; {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:14,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:14,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {793#(< (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; {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:14,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {793#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:14,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {793#(< (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); {809#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 12:02:14,255 INFO L272 TraceCheckUtils]: 14: Hoare triple {809#(< |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:14,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:14,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {762#false} is VALID [2022-04-15 12:02:14,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {762#false} assume !false; {762#false} is VALID [2022-04-15 12:02:14,257 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-15 12:02:14,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:14,421 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-15 12:02:14,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-04-15 12:02:20,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {762#false} assume !false; {762#false} is VALID [2022-04-15 12:02:20,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {762#false} is VALID [2022-04-15 12:02:20,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:02:20,783 INFO L272 TraceCheckUtils]: 14: Hoare triple {833#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:02:20,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#(<= (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); {833#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 12:02:20,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:20,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(<= (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; {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:20,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:20,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(<= (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; {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:20,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {837#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 12:02:20,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (>= aux_mod_main_~N_LIN~0_30 4294967296) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4)) 0) (> 0 aux_mod_main_~N_LIN~0_30)))} 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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {853#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} is VALID [2022-04-15 12:02:20,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {861#(or (forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (= (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4) 0) (>= aux_mod_main_~N_LIN~0_30 4294967296) (> 0 aux_mod_main_~N_LIN~0_30))) (<= 4294967295 (mod main_~j~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {857#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (>= aux_mod_main_~N_LIN~0_30 4294967296) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4)) 0) (> 0 aux_mod_main_~N_LIN~0_30)))} is VALID [2022-04-15 12:02:20,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {861#(or (forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (= (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4) 0) (>= aux_mod_main_~N_LIN~0_30 4294967296) (> 0 aux_mod_main_~N_LIN~0_30))) (<= 4294967295 (mod main_~j~0 4294967296)))} is VALID [2022-04-15 12:02:20,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {761#true} call #t~ret11 := main(); {761#true} is VALID [2022-04-15 12:02:20,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {761#true} {761#true} #56#return; {761#true} is VALID [2022-04-15 12:02:20,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {761#true} assume true; {761#true} is VALID [2022-04-15 12:02:20,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#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); {761#true} is VALID [2022-04-15 12:02:20,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2022-04-15 12:02:20,790 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-15 12:02:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456094666] [2022-04-15 12:02:20,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:02:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855074469] [2022-04-15 12:02:20,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855074469] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:20,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:02:20,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 12:02:20,791 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779531467] [2022-04-15 12:02:20,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779531467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:20,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:20,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:02:20,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087655151] [2022-04-15 12:02:20,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:20,794 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-15 12:02:20,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:20,794 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-15 12:02:20,818 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-15 12:02:20,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:02:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:20,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:02:20,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:02:20,819 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-15 12:02:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:21,326 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 12:02:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:02:21,327 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-15 12:02:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:21,327 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-15 12:02:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-15 12:02:21,328 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-15 12:02:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-15 12:02:21,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2022-04-15 12:02:21,377 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-15 12:02:21,379 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:02:21,379 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:02:21,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:02:21,382 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:02:21,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:02:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:02:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2022-04-15 12:02:21,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:21,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 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-15 12:02:21,393 INFO L74 IsIncluded]: Start isIncluded. First operand 36 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-15 12:02:21,393 INFO L87 Difference]: Start difference. First operand 36 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-15 12:02:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:21,394 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 12:02:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 12:02:21,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:21,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:21,395 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 36 states. [2022-04-15 12:02:21,395 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 36 states. [2022-04-15 12:02:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:21,396 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 12:02:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 12:02:21,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:21,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:21,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:21,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:21,397 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-15 12:02:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 12:02:21,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-04-15 12:02:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:21,398 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 12:02:21,398 INFO L479 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-15 12:02:21,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 12:02:21,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 12:02:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:02:21,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:21,450 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:21,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:21,658 WARN L460 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-15 12:02:21,658 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 867522333, now seen corresponding path program 3 times [2022-04-15 12:02:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:21,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541587895] [2022-04-15 12:02:21,791 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:21,826 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:21,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 867522333, now seen corresponding path program 4 times [2022-04-15 12:02:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:21,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599688451] [2022-04-15 12:02:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:21,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:21,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800883908] [2022-04-15 12:02:21,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:02:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:21,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:21,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:02:21,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:02:21,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:02:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:21,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:21,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1096#true} is VALID [2022-04-15 12:02:21,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#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); {1096#true} is VALID [2022-04-15 12:02:21,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume true; {1096#true} is VALID [2022-04-15 12:02:21,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} #56#return; {1096#true} is VALID [2022-04-15 12:02:21,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} call #t~ret11 := main(); {1096#true} is VALID [2022-04-15 12:02:21,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1116#(= main_~N_LIN~0 1)} is VALID [2022-04-15 12:02:21,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~N_LIN~0 1)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1120#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:21,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1120#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1120#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:21,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {1120#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1120#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:21,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1120#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1130#(and (= main_~k~0 1) (= main_~N_LIN~0 1))} is VALID [2022-04-15 12:02:21,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1097#false} is VALID [2022-04-15 12:02:21,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1097#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1097#false} is VALID [2022-04-15 12:02:21,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1097#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1097#false} is VALID [2022-04-15 12:02:21,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1097#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1097#false} is VALID [2022-04-15 12:02:21,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1097#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1097#false} is VALID [2022-04-15 12:02:21,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1097#false} is VALID [2022-04-15 12:02:21,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1097#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1097#false} is VALID [2022-04-15 12:02:21,958 INFO L272 TraceCheckUtils]: 17: Hoare triple {1097#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1097#false} is VALID [2022-04-15 12:02:21,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1097#false} ~cond := #in~cond; {1097#false} is VALID [2022-04-15 12:02:21,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {1097#false} assume 0 == ~cond; {1097#false} is VALID [2022-04-15 12:02:21,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2022-04-15 12:02:21,959 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-15 12:02:21,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:22,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {1097#false} assume 0 == ~cond; {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {1097#false} ~cond := #in~cond; {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {1097#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {1097#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {1097#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1097#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {1097#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1097#false} is VALID [2022-04-15 12:02:22,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {1097#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1097#false} is VALID [2022-04-15 12:02:22,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {1194#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1097#false} is VALID [2022-04-15 12:02:22,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1198#(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; {1194#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 12:02:22,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1198#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1198#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 12:02:22,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1198#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1198#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 12:02:22,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {1208#(not (< 1 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1198#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 12:02:22,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1208#(not (< 1 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 12:02:22,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {1096#true} call #t~ret11 := main(); {1096#true} is VALID [2022-04-15 12:02:22,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1096#true} {1096#true} #56#return; {1096#true} is VALID [2022-04-15 12:02:22,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume true; {1096#true} is VALID [2022-04-15 12:02:22,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#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); {1096#true} is VALID [2022-04-15 12:02:22,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1096#true} is VALID [2022-04-15 12:02:22,034 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-15 12:02:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599688451] [2022-04-15 12:02:22,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:02:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800883908] [2022-04-15 12:02:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800883908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:22,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:02:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 12:02:22,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541587895] [2022-04-15 12:02:22,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541587895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:22,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:22,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:02:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894353190] [2022-04-15 12:02:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:22,035 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-15 12:02:22,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:22,036 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-15 12:02:22,058 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-15 12:02:22,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:02:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:02:22,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:02:22,060 INFO L87 Difference]: Start difference. First operand 24 states and 28 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-15 12:02:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:22,109 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-15 12:02:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:02:22,109 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-15 12:02:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:22,109 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-15 12:02:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 12:02:22,110 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-15 12:02:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 12:02:22,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-15 12:02:22,134 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-15 12:02:22,135 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:02:22,135 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:02:22,136 INFO L912 BasicCegarLoop]: 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-15 12:02:22,136 INFO L913 BasicCegarLoop]: 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-15 12:02:22,136 INFO L914 BasicCegarLoop]: 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-15 12:02:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:02:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 12:02:22,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:22,144 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-15 12:02:22,145 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-15 12:02:22,145 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-15 12:02:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:22,146 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:02:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:02:22,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:22,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:22,146 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-15 12:02:22,146 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-15 12:02:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:22,147 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:02:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:02:22,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:22,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:22,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:22,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:22,147 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-15 12:02:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:02:22,148 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 12:02:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:22,148 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:02:22,148 INFO L479 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-15 12:02:22,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:02:22,171 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-15 12:02:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:02:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:02:22,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:22,171 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:02:22,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:02:22,387 WARN L460 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-15 12:02:22,387 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 5 times [2022-04-15 12:02:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825519647] [2022-04-15 12:02:22,466 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:22,479 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:22,479 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 6 times [2022-04-15 12:02:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:22,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471712010] [2022-04-15 12:02:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:22,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:02:22,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064532075] [2022-04-15 12:02:22,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:02:22,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:22,504 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:02:22,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:02:22,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-15 12:02:22,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:22,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:02:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:22,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:22,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {1411#true} call ULTIMATE.init(); {1411#true} is VALID [2022-04-15 12:02:22,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1411#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); {1411#true} is VALID [2022-04-15 12:02:22,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {1411#true} assume true; {1411#true} is VALID [2022-04-15 12:02:22,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1411#true} {1411#true} #56#return; {1411#true} is VALID [2022-04-15 12:02:22,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {1411#true} call #t~ret11 := main(); {1411#true} is VALID [2022-04-15 12:02:22,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {1411#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 12:02:22,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 12:02:22,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {1431#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 12:02:22,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 12:02:22,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 12:02:22,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 12:02:22,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1431#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1450#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {1450#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {1412#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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {1412#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {1412#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {1412#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {1412#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {1412#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {1412#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1412#false} is VALID [2022-04-15 12:02:22,624 INFO L272 TraceCheckUtils]: 20: Hoare triple {1412#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1412#false} is VALID [2022-04-15 12:02:22,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {1412#false} ~cond := #in~cond; {1412#false} is VALID [2022-04-15 12:02:22,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {1412#false} assume 0 == ~cond; {1412#false} is VALID [2022-04-15 12:02:22,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {1412#false} assume !false; {1412#false} is VALID [2022-04-15 12:02:22,625 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-15 12:02:22,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:02:22,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {1412#false} assume !false; {1412#false} is VALID [2022-04-15 12:02:22,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {1412#false} assume 0 == ~cond; {1412#false} is VALID [2022-04-15 12:02:22,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {1412#false} ~cond := #in~cond; {1412#false} is VALID [2022-04-15 12:02:22,703 INFO L272 TraceCheckUtils]: 20: Hoare triple {1412#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1412#false} is VALID [2022-04-15 12:02:22,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {1412#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {1412#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1412#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {1412#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {1412#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {1412#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1412#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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1412#false} is VALID [2022-04-15 12:02:22,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1520#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1412#false} is VALID [2022-04-15 12:02:22,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {1524#(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; {1520#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#(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; {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {1524#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {1524#(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 + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1411#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 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1524#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 12:02:22,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {1411#true} call #t~ret11 := main(); {1411#true} is VALID [2022-04-15 12:02:22,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1411#true} {1411#true} #56#return; {1411#true} is VALID [2022-04-15 12:02:22,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {1411#true} assume true; {1411#true} is VALID [2022-04-15 12:02:22,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1411#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); {1411#true} is VALID [2022-04-15 12:02:22,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {1411#true} call ULTIMATE.init(); {1411#true} is VALID [2022-04-15 12:02:22,708 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-15 12:02:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471712010] [2022-04-15 12:02:22,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:02:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064532075] [2022-04-15 12:02:22,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064532075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:02:22,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:02:22,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-15 12:02:22,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:22,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825519647] [2022-04-15 12:02:22,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825519647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:22,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:22,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:02:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317412156] [2022-04-15 12:02:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:22,709 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-15 12:02:22,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:22,709 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-15 12:02:22,725 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-15 12:02:22,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:02:22,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:22,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:02:22,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:02:22,725 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-15 12:02:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:22,753 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:02:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:02:22,753 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-15 12:02:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:22,753 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-15 12:02:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-15 12:02:22,754 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-15 12:02:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-15 12:02:22,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-15 12:02:22,775 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-15 12:02:22,775 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:02:22,775 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:02:22,776 INFO L912 BasicCegarLoop]: 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-15 12:02:22,776 INFO L913 BasicCegarLoop]: 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-15 12:02:22,776 INFO L914 BasicCegarLoop]: 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-15 12:02:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:02:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:02:22,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:22,777 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-15 12:02:22,777 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-15 12:02:22,777 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-15 12:02:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:22,777 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:02:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:02:22,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:22,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:22,777 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-15 12:02:22,777 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-15 12:02:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:22,778 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:02:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:02:22,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:22,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:22,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:22,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:22,778 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-15 12:02:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:02:22,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-15 12:02:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:22,778 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:02:22,778 INFO L479 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-15 12:02:22,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:02:22,778 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-15 12:02:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:02:22,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:22,780 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:02:22,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 12:02:22,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:22,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:02:23,121 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:02:23,122 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:02:23,122 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:02:23,122 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 33) the Hoare annotation is: true [2022-04-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 33) the Hoare annotation is: true [2022-04-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-15 12:02:23,122 INFO L885 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: true [2022-04-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L878 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-15 12:02:23,122 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,122 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 12:02:23,123 INFO L878 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-15 12:02:23,123 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 12:02:23,123 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 12:02:23,125 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2, 2, 2, 1] [2022-04-15 12:02:23,126 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:02:23,128 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:02:23,130 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:02:23,140 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-15 12:02:23,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:02:23 BoogieIcfgContainer [2022-04-15 12:02:23,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:02:23,148 INFO L158 Benchmark]: Toolchain (without parser) took 13020.37ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 122.2MB in the beginning and 69.8MB in the end (delta: 52.4MB). Peak memory consumption was 88.0MB. Max. memory is 8.0GB. [2022-04-15 12:02:23,148 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:02:23,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.66ms. Allocated memory is still 169.9MB. Free memory was 122.0MB in the beginning and 149.3MB in the end (delta: -27.3MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-15 12:02:23,149 INFO L158 Benchmark]: Boogie Preprocessor took 21.78ms. Allocated memory is still 169.9MB. Free memory was 149.3MB in the beginning and 147.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:02:23,149 INFO L158 Benchmark]: RCFGBuilder took 267.89ms. Allocated memory is still 169.9MB. Free memory was 147.6MB in the beginning and 135.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:02:23,149 INFO L158 Benchmark]: TraceAbstraction took 12518.30ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 134.7MB in the beginning and 69.8MB in the end (delta: 64.8MB). Peak memory consumption was 101.5MB. Max. memory is 8.0GB. [2022-04-15 12:02:23,150 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.17ms. Allocated memory is still 169.9MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.66ms. Allocated memory is still 169.9MB. Free memory was 122.0MB in the beginning and 149.3MB in the end (delta: -27.3MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.78ms. Allocated memory is still 169.9MB. Free memory was 149.3MB in the beginning and 147.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 267.89ms. Allocated memory is still 169.9MB. Free memory was 147.6MB in the beginning and 135.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12518.30ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 134.7MB in the beginning and 69.8MB in the end (delta: 64.8MB). Peak memory consumption was 101.5MB. 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: 12.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 85 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 80 NumberOfFragments, 173 HoareAnnotationTreeSize, 54 FomulaSimplifications, 148 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 44 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-15 12:02:23,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...