/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:54,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:54,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:54,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:54,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:54,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:54,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:54,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:54,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:54,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:54,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:54,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:54,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:54,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:54,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:54,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:54,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:54,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:54,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:54,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:54,831 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:54,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:54,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:54,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:54,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:54,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:54,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:54,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:54,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:54,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:54,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:54,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:54,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:54,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:54,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:54,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:54,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:54,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:54,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:54,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:54,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:54,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:54,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:54,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:54,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:54,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:54,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:54,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:54,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:54,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:54,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:54,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:54,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:54,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:54,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:54,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:54,870 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,871 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:54,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:54,871 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:54,871 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 05:41:55,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:55,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:55,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:55,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:55,077 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:55,079 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 05:41:55,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a49b378/faece110298146d5b8b9464799b074c5/FLAGb77a2bf62 [2022-04-15 05:41:55,512 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:55,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-15 05:41:55,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a49b378/faece110298146d5b8b9464799b074c5/FLAGb77a2bf62 [2022-04-15 05:41:55,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a49b378/faece110298146d5b8b9464799b074c5 [2022-04-15 05:41:55,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:55,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:55,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:55,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:55,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:55,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:55" (1/1) ... [2022-04-15 05:41:55,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67931ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:55, skipping insertion in model container [2022-04-15 05:41:55,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:55" (1/1) ... [2022-04-15 05:41:55,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:55,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:56,086 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 05:41:56,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:56,104 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:56,112 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 05:41:56,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:56,127 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:56,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56 WrapperNode [2022-04-15 05:41:56,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:56,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:56,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:56,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:56,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:56,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:56,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:56,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:56,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (1/1) ... [2022-04-15 05:41:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,219 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 05:41:56,238 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 05:41:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:56,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:56,253 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:56,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:41:56,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:41:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:41:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:56,307 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:56,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:56,435 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:56,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:56,440 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 05:41:56,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:56 BoogieIcfgContainer [2022-04-15 05:41:56,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:56,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:56,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:56,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:56,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:55" (1/3) ... [2022-04-15 05:41:56,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c8274b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:56, skipping insertion in model container [2022-04-15 05:41:56,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:56" (2/3) ... [2022-04-15 05:41:56,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c8274b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:56, skipping insertion in model container [2022-04-15 05:41:56,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:56" (3/3) ... [2022-04-15 05:41:56,447 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-15 05:41:56,450 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:56,450 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:56,485 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:56,496 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 05:41:56,496 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:56,514 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 05:41:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:41:56,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:56,519 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:56,520 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-15 05:41:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92817283] [2022-04-15 05:41:56,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 2 times [2022-04-15 05:41:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984937443] [2022-04-15 05:41:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:41:56,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232932257] [2022-04-15 05:41:56,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:56,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,648 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 05:41:56,649 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 05:41:56,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:41:56,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:56,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:41:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:56,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-15 05:41:56,778 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 05:41:56,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 05:41:56,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-15 05:41:56,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-15 05:41:56,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:41:56,781 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 05:41:56,781 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 05:41:56,781 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 05:41:56,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 05:41:56,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 05:41:56,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 05:41:56,782 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 05:41:56,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:41:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984937443] [2022-04-15 05:41:56,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:41:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232932257] [2022-04-15 05:41:56,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232932257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:56,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:56,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92817283] [2022-04-15 05:41:56,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92817283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852844522] [2022-04-15 05:41:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:56,790 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 05:41:56,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:56,793 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 05:41:56,808 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 05:41:56,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:41:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:41:56,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:56,843 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 05:41:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,929 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-15 05:41:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:41:56,930 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 05:41:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:56,931 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 05:41:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 05:41:56,940 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 05:41:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 05:41:56,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-15 05:41:57,007 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 05:41:57,016 INFO L225 Difference]: With dead ends: 47 [2022-04-15 05:41:57,016 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:41:57,018 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 05:41:57,021 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 05:41:57,021 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 05:41:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:41:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-15 05:41:57,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:57,043 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 05:41:57,044 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 05:41:57,044 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 05:41:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,047 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 05:41:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 05:41:57,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,048 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 05:41:57,048 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 05:41:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,050 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 05:41:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 05:41:57,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:57,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:57,058 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 05:41:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 05:41:57,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-15 05:41:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:57,061 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 05:41:57,061 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 05:41:57,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 05:41:57,079 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 05:41:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 05:41:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:41:57,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:57,080 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:57,099 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 05:41:57,299 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 05:41:57,299 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-15 05:41:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888467724] [2022-04-15 05:42:02,385 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:42:02,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:02,646 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1715536111, now seen corresponding path program 1 times [2022-04-15 05:42:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:02,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982610491] [2022-04-15 05:42:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:02,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:42:02,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233202464] [2022-04-15 05:42:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:02,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:02,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:02,674 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 05:42:02,677 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 05:42:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:02,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:42:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:02,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:02,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-15 05:42:02,837 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 05:42:02,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-15 05:42:02,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #56#return; {239#true} is VALID [2022-04-15 05:42:02,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret11 := main(); {239#true} is VALID [2022-04-15 05:42:02,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {259#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:42:02,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [60] L21-3-->L21-4_primed: Formula: (let ((.cse3 (mod v_main_~N_COL~0_4 4294967296))) (let ((.cse0 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse1 (= v_main_~k~0_9 v_main_~k~0_8)) (.cse2 (= v_main_~j~0_10 v_main_~j~0_9)) (.cse5 (< (mod v_main_~j~0_10 4294967296) .cse3)) (.cse4 (<= (mod v_main_~N_LIN~0_5 4294967296) 0))) (or (and (= v_main_~N_COL~0_4 v_main_~N_COL~0_4) .cse0 .cse1 (= v_main_~N_LIN~0_5 v_main_~N_LIN~0_5) .cse2) (and (<= (div (+ .cse3 (* (- 1) v_main_~j~0_9)) (- 4294967296)) (+ (div (+ v_main_~j~0_10 (- 4294967295)) 4294967296) 1)) .cse4 (< v_main_~j~0_10 v_main_~j~0_9) (= v_main_~k~0_8 0) .cse5) (and .cse0 .cse1 .cse2 (or (not .cse5) (not .cse4)))))) InVars {main_#t~post5=|v_main_#t~post5_4|, main_~N_COL~0=v_main_~N_COL~0_4, main_~N_LIN~0=v_main_~N_LIN~0_5, main_~k~0=v_main_~k~0_9, main_~j~0=v_main_~j~0_10} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~N_COL~0=v_main_~N_COL~0_4, main_~N_LIN~0=v_main_~N_LIN~0_5, main_~k~0=v_main_~k~0_8, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post5] {263#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:42:02,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [59] L21-4_primed-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~N_COL~0=v_main_~N_COL~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~N_COL~0=v_main_~N_COL~0_2} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 05:42:02,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {240#false} is VALID [2022-04-15 05:42:02,841 INFO L272 TraceCheckUtils]: 9: Hoare triple {240#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {240#false} is VALID [2022-04-15 05:42:02,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2022-04-15 05:42:02,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2022-04-15 05:42:02,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-15 05:42:02,842 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 05:42:02,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:42:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:02,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982610491] [2022-04-15 05:42:02,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:42:02,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233202464] [2022-04-15 05:42:02,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233202464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:02,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:02,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:02,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:02,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888467724] [2022-04-15 05:42:02,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888467724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:02,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:02,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346602777] [2022-04-15 05:42:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:02,904 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 05:42:02,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:02,904 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 05:42:02,914 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 05:42:02,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:42:02,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:02,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:42:02,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:42:02,915 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 05:42:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:02,970 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 05:42:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:42:02,970 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 05:42:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:02,970 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 05:42:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-15 05:42:02,971 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 05:42:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-15 05:42:02,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-15 05:42:03,009 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 05:42:03,010 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:42:03,010 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 05:42:03,010 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:42:03,011 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:03,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 05:42:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-15 05:42:03,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:03,014 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 05:42:03,014 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 05:42:03,014 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 05:42:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,015 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 05:42:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 05:42:03,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,016 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 05:42:03,016 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 05:42:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:03,017 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 05:42:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 05:42:03,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:03,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:03,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:03,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:03,018 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 05:42:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 05:42:03,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 05:42:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:03,019 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 05:42:03,019 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 05:42:03,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 05:42:03,034 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 05:42:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 05:42:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:42:03,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:03,034 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 05:42:03,076 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 05:42:03,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 05:42:03,249 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-15 05:42:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:03,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1152826939] [2022-04-15 05:42:11,131 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:11,132 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:11,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:11,292 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:11,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 2 times [2022-04-15 05:42:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937521066] [2022-04-15 05:42:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:11,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:42:11,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724989324] [2022-04-15 05:42:11,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:11,324 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 05:42:11,353 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 05:42:11,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:11,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:42:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:11,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 292 [2022-04-15 05:42:11,839 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-15 05:42:11,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-15 05:42:11,974 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 05:42:12,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2022-04-15 05:42:12,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {442#true} is VALID [2022-04-15 05:42:12,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2022-04-15 05:42:12,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #56#return; {442#true} is VALID [2022-04-15 05:42:12,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret11 := main(); {442#true} is VALID [2022-04-15 05:42:12,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {462#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:42:12,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:42:12,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:42:12,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:12,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:12,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:12,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:12,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:12,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {489#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 05:42:12,046 INFO L272 TraceCheckUtils]: 14: Hoare triple {489#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {493#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:12,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {497#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:12,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {443#false} is VALID [2022-04-15 05:42:12,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#false} assume !false; {443#false} is VALID [2022-04-15 05:42:12,047 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 05:42:12,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:13,770 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 30 treesize of output 28 [2022-04-15 05:42:13,785 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 54 treesize of output 52 [2022-04-15 05:42:14,584 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-15 05:42:14,621 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-15 05:42:15,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-04-15 05:42:15,020 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 52 treesize of output 50 [2022-04-15 05:42:15,069 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 05:42:15,084 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 48 treesize of output 46 [2022-04-15 05:42:15,248 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-15 05:42:15,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-04-15 05:42:15,323 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 50 treesize of output 48 [2022-04-15 05:42:15,364 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 05:42:15,374 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 48 treesize of output 46 [2022-04-15 05:42:15,672 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 05:42:15,685 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 05:42:19,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#false} assume !false; {443#false} is VALID [2022-04-15 05:42:19,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {443#false} is VALID [2022-04-15 05:42:19,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {497#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:19,678 INFO L272 TraceCheckUtils]: 14: Hoare triple {489#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {493#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:19,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {489#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 05:42:19,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:19,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:19,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:19,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:19,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {531#(and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|)))) (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))))) (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|))))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (mod main_~k~0 4294967296) 2147483647) (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (- 17179869184) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (not (<= (mod main_~N_LIN~0 4294967296) 2147483647))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))))))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {473#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:19,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {535#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (<= (mod main_~k~0 4294967296) 2147483647)))))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {531#(and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|)))) (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))))) (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|))))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (mod main_~k~0 4294967296) 2147483647) (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (- 17179869184) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (not (<= (mod main_~N_LIN~0 4294967296) 2147483647))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))))))} is VALID [2022-04-15 05:42:19,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {539#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (not (< 0 (mod main_~N_LIN~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {535#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (<= (mod main_~k~0 4294967296) 2147483647)))))} is VALID [2022-04-15 05:42:19,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {539#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (not (< 0 (mod main_~N_LIN~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-15 05:42:19,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret11 := main(); {442#true} is VALID [2022-04-15 05:42:19,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #56#return; {442#true} is VALID [2022-04-15 05:42:19,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2022-04-15 05:42:19,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {442#true} is VALID [2022-04-15 05:42:19,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2022-04-15 05:42:19,792 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 05:42:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937521066] [2022-04-15 05:42:19,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:42:19,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724989324] [2022-04-15 05:42:19,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724989324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:19,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 05:42:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-15 05:42:19,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:19,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1152826939] [2022-04-15 05:42:19,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1152826939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:19,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:42:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925910811] [2022-04-15 05:42:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:19,794 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 05:42:19,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:19,794 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 05:42:19,816 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 05:42:19,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:42:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:42:19,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:42:19,817 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 05:42:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:20,217 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 05:42:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:42:20,217 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 05:42:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:20,218 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 05:42:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 05:42:20,219 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 05:42:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 05:42:20,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-15 05:42:20,261 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 05:42:20,262 INFO L225 Difference]: With dead ends: 37 [2022-04-15 05:42:20,262 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 05:42:20,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:42:20,263 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:20,263 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.2s Time] [2022-04-15 05:42:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 05:42:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-15 05:42:20,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:20,273 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 05:42:20,273 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 05:42:20,273 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 05:42:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:20,275 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 05:42:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 05:42:20,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:20,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:20,275 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 05:42:20,275 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 05:42:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:20,276 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 05:42:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 05:42:20,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:20,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:20,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:20,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:20,277 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 05:42:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 05:42:20,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-04-15 05:42:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:20,278 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 05:42:20,278 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 05:42:20,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 05:42:20,314 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 05:42:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 05:42:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:42:20,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:20,315 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 05:42:20,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:20,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:20,515 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 1 times [2022-04-15 05:42:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:20,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994556054] [2022-04-15 05:42:26,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:26,029 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:26,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:26,285 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:26,285 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 2 times [2022-04-15 05:42:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:26,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487093176] [2022-04-15 05:42:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:26,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:42:26,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551829091] [2022-04-15 05:42:26,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:26,306 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 05:42:26,308 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 05:42:26,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:26,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:26,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:42:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:26,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:27,153 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 05:42:27,216 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 05:42:27,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2022-04-15 05:42:27,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {754#true} is VALID [2022-04-15 05:42:27,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2022-04-15 05:42:27,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #56#return; {754#true} is VALID [2022-04-15 05:42:27,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret11 := main(); {754#true} is VALID [2022-04-15 05:42:27,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {774#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:42:27,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {778#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:42:27,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {782#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} is VALID [2022-04-15 05:42:27,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:27,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:27,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:27,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:27,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:27,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {802#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 05:42:27,295 INFO L272 TraceCheckUtils]: 14: Hoare triple {802#(< |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:27,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:27,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {755#false} is VALID [2022-04-15 05:42:27,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#false} assume !false; {755#false} is VALID [2022-04-15 05:42:27,296 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 05:42:27,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:28,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-04-15 05:42:28,784 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 50 treesize of output 48 [2022-04-15 05:42:29,655 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 31 treesize of output 29 [2022-04-15 05:42:29,668 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 54 treesize of output 52 [2022-04-15 05:42:29,833 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 32 treesize of output 30 [2022-04-15 05:42:29,847 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 56 treesize of output 54 [2022-04-15 05:42:30,709 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 30 treesize of output 28 [2022-04-15 05:42:30,722 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 52 treesize of output 50 [2022-04-15 05:42:31,990 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 30 treesize of output 28 [2022-04-15 05:42:32,002 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 52 treesize of output 50 [2022-04-15 05:42:32,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-04-15 05:42:32,046 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 48 treesize of output 46 [2022-04-15 05:42:32,341 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 05:42:32,354 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 05:42:32,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-04-15 05:42:32,403 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 50 treesize of output 48 [2022-04-15 05:42:37,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#false} assume !false; {755#false} is VALID [2022-04-15 05:42:37,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {755#false} is VALID [2022-04-15 05:42:37,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:37,613 INFO L272 TraceCheckUtils]: 14: Hoare triple {826#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:37,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {826#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-15 05:42:37,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:37,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:37,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:37,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:37,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {846#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {830#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-15 05:42:37,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) 0)) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))))) (not (<= (mod main_~k~0 4294967296) 2147483647))) (or (and (<= (mod main_~N_LIN~0 4294967296) 2147483647) (= 17179869184 (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (and (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647)) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))))) (<= (mod main_~j~0 4294967296) 2147483647)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {846#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} is VALID [2022-04-15 05:42:37,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(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; {850#(and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) 0)) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))))) (not (<= (mod main_~k~0 4294967296) 2147483647))) (or (and (<= (mod main_~N_LIN~0 4294967296) 2147483647) (= 17179869184 (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (and (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647)) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))))) (<= (mod main_~j~0 4294967296) 2147483647)))} is VALID [2022-04-15 05:42:37,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {854#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) 0) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-15 05:42:37,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret11 := main(); {754#true} is VALID [2022-04-15 05:42:37,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #56#return; {754#true} is VALID [2022-04-15 05:42:37,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2022-04-15 05:42:37,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {754#true} is VALID [2022-04-15 05:42:37,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2022-04-15 05:42:37,639 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 05:42:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487093176] [2022-04-15 05:42:37,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:42:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551829091] [2022-04-15 05:42:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551829091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:37,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 05:42:37,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 05:42:37,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994556054] [2022-04-15 05:42:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994556054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:37,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430092094] [2022-04-15 05:42:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:37,640 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 05:42:37,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:37,640 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 05:42:37,666 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 05:42:37,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:37,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:37,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:42:37,667 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 05:42:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:38,190 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-15 05:42:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:42:38,190 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 05:42:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:38,191 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 05:42:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-15 05:42:38,192 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 05:42:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-15 05:42:38,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2022-04-15 05:42:38,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:38,242 INFO L225 Difference]: With dead ends: 43 [2022-04-15 05:42:38,242 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 05:42:38,242 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:42:38,243 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:38,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 05:42:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-04-15 05:42:38,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:38,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:38,259 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:38,260 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:38,262 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 05:42:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-15 05:42:38,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:38,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:38,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 05:42:38,262 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 05:42:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:38,263 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 05:42:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-15 05:42:38,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:38,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:38,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:38,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 05:42:38,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 18 [2022-04-15 05:42:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:38,265 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 05:42:38,265 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 05:42:38,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 05:42:38,315 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 05:42:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 05:42:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:42:38,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:38,316 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 05:42:38,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 05:42:38,531 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 05:42:38,532 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash 867522333, now seen corresponding path program 3 times [2022-04-15 05:42:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:38,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916247367] [2022-04-15 05:42:50,473 WARN L232 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 05:43:01,326 WARN L232 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 05:43:01,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:01,356 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:02,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:02,827 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:43:02,827 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash 867522333, now seen corresponding path program 4 times [2022-04-15 05:43:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:02,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303075289] [2022-04-15 05:43:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:02,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:43:02,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894215453] [2022-04-15 05:43:02,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:43:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:02,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:02,845 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 05:43:02,865 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 05:43:02,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:43:02,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:02,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:43:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:02,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:02,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {1105#true} call ULTIMATE.init(); {1105#true} is VALID [2022-04-15 05:43:02,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1105#true} is VALID [2022-04-15 05:43:02,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-04-15 05:43:02,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1105#true} {1105#true} #56#return; {1105#true} is VALID [2022-04-15 05:43:02,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {1105#true} call #t~ret11 := main(); {1105#true} is VALID [2022-04-15 05:43:02,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1125#(= main_~N_LIN~0 1)} is VALID [2022-04-15 05:43:02,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {1125#(= main_~N_LIN~0 1)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:43:02,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:43:02,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:43:02,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {1129#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1139#(and (= main_~k~0 1) (= main_~N_LIN~0 1))} is VALID [2022-04-15 05:43:02,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {1139#(and (= main_~k~0 1) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {1106#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {1106#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {1106#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L272 TraceCheckUtils]: 17: Hoare triple {1106#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {1106#false} ~cond := #in~cond; {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {1106#false} assume 0 == ~cond; {1106#false} is VALID [2022-04-15 05:43:02,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-04-15 05:43:02,995 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 05:43:02,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:03,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {1106#false} assume 0 == ~cond; {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {1106#false} ~cond := #in~cond; {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L272 TraceCheckUtils]: 17: Hoare triple {1106#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {1106#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {1106#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {1106#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1106#false} is VALID [2022-04-15 05:43:03,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1106#false} is VALID [2022-04-15 05:43:03,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {1203#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1106#false} is VALID [2022-04-15 05:43:03,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1203#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 05:43:03,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 05:43:03,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 05:43:03,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {1217#(not (< 1 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1207#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 05:43:03,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1217#(not (< 1 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-15 05:43:03,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {1105#true} call #t~ret11 := main(); {1105#true} is VALID [2022-04-15 05:43:03,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1105#true} {1105#true} #56#return; {1105#true} is VALID [2022-04-15 05:43:03,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-04-15 05:43:03,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1105#true} is VALID [2022-04-15 05:43:03,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {1105#true} call ULTIMATE.init(); {1105#true} is VALID [2022-04-15 05:43:03,079 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 05:43:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:03,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303075289] [2022-04-15 05:43:03,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:43:03,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894215453] [2022-04-15 05:43:03,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894215453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:03,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 05:43:03,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 05:43:03,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:03,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916247367] [2022-04-15 05:43:03,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916247367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:03,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:03,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:43:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306683543] [2022-04-15 05:43:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:03,089 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 05:43:03,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:03,089 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 05:43:03,108 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 05:43:03,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:43:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:03,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:43:03,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:43:03,109 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:43:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:03,163 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-15 05:43:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:43:03,164 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 05:43:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:03,164 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 05:43:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 05:43:03,165 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 05:43:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 05:43:03,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-15 05:43:03,196 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 05:43:03,197 INFO L225 Difference]: With dead ends: 45 [2022-04-15 05:43:03,197 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:43:03,197 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 05:43:03,198 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 05:43:03,198 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 05:43:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:43:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 05:43:03,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:03,206 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 05:43:03,206 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 05:43:03,206 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 05:43:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:03,207 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:43:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:43:03,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:03,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:03,207 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 05:43:03,208 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 05:43:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:03,208 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:43:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:43:03,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:03,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:03,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:03,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:03,209 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 05:43:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 05:43:03,209 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 05:43:03,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:03,209 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 05:43:03,210 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 05:43:03,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 05:43:03,241 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 05:43:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 05:43:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:43:03,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:03,241 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 05:43:03,258 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 05:43:03,442 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 05:43:03,442 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 5 times [2022-04-15 05:43:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520247520] [2022-04-15 05:43:14,873 WARN L232 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 05:43:14,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:14,930 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:17,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:17,167 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:17,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 6 times [2022-04-15 05:43:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:17,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827474343] [2022-04-15 05:43:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:17,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:43:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205727216] [2022-04-15 05:43:17,209 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:43:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:17,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:17,221 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 05:43:17,222 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 05:43:17,274 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-15 05:43:17,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:43:17,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:17,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:17,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2022-04-15 05:43:17,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1430#true} is VALID [2022-04-15 05:43:17,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-15 05:43:17,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #56#return; {1430#true} is VALID [2022-04-15 05:43:17,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret11 := main(); {1430#true} is VALID [2022-04-15 05:43:17,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:43:17,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:43:17,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:43:17,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:43:17,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:43:17,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {1450#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1469#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {1469#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1431#false} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1431#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1431#false} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1431#false} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1431#false} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1431#false} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {1431#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1431#false} is VALID [2022-04-15 05:43:17,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {1431#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1431#false} is VALID [2022-04-15 05:43:17,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {1431#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1431#false} is VALID [2022-04-15 05:43:17,406 INFO L272 TraceCheckUtils]: 20: Hoare triple {1431#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1431#false} is VALID [2022-04-15 05:43:17,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-15 05:43:17,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-15 05:43:17,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-15 05:43:17,406 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 05:43:17,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:17,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-15 05:43:17,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L272 TraceCheckUtils]: 20: Hoare triple {1431#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {1431#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {1431#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {1431#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1431#false} is VALID [2022-04-15 05:43:17,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1431#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1431#false} is VALID [2022-04-15 05:43:17,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1431#false} is VALID [2022-04-15 05:43:17,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1539#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1543#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:43:17,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret11 := main(); {1430#true} is VALID [2022-04-15 05:43:17,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #56#return; {1430#true} is VALID [2022-04-15 05:43:17,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-15 05:43:17,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1430#true} is VALID [2022-04-15 05:43:17,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2022-04-15 05:43:17,509 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 05:43:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827474343] [2022-04-15 05:43:17,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:43:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205727216] [2022-04-15 05:43:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205727216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:17,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 05:43:17,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-15 05:43:17,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:17,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520247520] [2022-04-15 05:43:17,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520247520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:17,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:17,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:43:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901757130] [2022-04-15 05:43:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:17,510 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 05:43:17,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:17,510 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 05:43:17,541 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 05:43:17,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:43:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:17,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:43:17,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:43:17,542 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 05:43:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:17,586 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 05:43:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:43:17,586 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 05:43:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:17,587 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 05:43:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-15 05:43:17,587 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 05:43:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-15 05:43:17,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-15 05:43:17,608 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 05:43:17,608 INFO L225 Difference]: With dead ends: 25 [2022-04-15 05:43:17,608 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:43:17,608 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 05:43:17,609 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 05:43:17,609 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 05:43:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:43:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:43:17,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:17,610 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 05:43:17,610 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 05:43:17,610 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 05:43:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:17,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:43:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:43:17,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:17,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:17,610 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 05:43:17,610 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 05:43:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:17,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:43:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:43:17,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:17,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:17,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:17,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:17,611 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 05:43:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:43:17,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-15 05:43:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:17,611 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:43:17,611 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 05:43:17,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 05:43:17,611 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 05:43:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:43:17,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:17,613 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:43:17,634 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 05:43:17,817 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 05:43:17,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:43:17,960 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 05:43:17,961 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 05:43:17,961 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 33) the Hoare annotation is: true [2022-04-15 05:43:17,961 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 05:43:17,961 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 05:43:17,961 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 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 33) the Hoare annotation is: true [2022-04-15 05:43:17,961 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 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-15 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: true [2022-04-15 05:43:17,961 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 05:43:17,961 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 05:43:17,961 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 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,961 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,962 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,962 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,962 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:43:17,962 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 05:43:17,962 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 05:43:17,962 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 05:43:17,962 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 05:43:17,962 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 05:43:17,962 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 05:43:17,964 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1] [2022-04-15 05:43:17,965 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:43:17,972 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:43:17,984 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 05:43:17,997 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 05:43:18,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:43:18 BoogieIcfgContainer [2022-04-15 05:43:18,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:43:18,011 INFO L158 Benchmark]: Toolchain (without parser) took 82067.27ms. Allocated memory was 205.5MB in the beginning and 284.2MB in the end (delta: 78.6MB). Free memory was 180.1MB in the beginning and 195.0MB in the end (delta: -14.9MB). Peak memory consumption was 63.7MB. Max. memory is 8.0GB. [2022-04-15 05:43:18,012 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:43:18,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.73ms. Allocated memory was 205.5MB in the beginning and 284.2MB in the end (delta: 78.6MB). Free memory was 179.9MB in the beginning and 257.7MB in the end (delta: -77.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-15 05:43:18,012 INFO L158 Benchmark]: Boogie Preprocessor took 36.06ms. Allocated memory is still 284.2MB. Free memory was 257.7MB in the beginning and 255.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:43:18,012 INFO L158 Benchmark]: RCFGBuilder took 275.97ms. Allocated memory is still 284.2MB. Free memory was 255.8MB in the beginning and 242.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 05:43:18,012 INFO L158 Benchmark]: TraceAbstraction took 81567.78ms. Allocated memory is still 284.2MB. Free memory was 242.0MB in the beginning and 195.6MB in the end (delta: 46.4MB). Peak memory consumption was 47.5MB. Max. memory is 8.0GB. [2022-04-15 05:43:18,013 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.73ms. Allocated memory was 205.5MB in the beginning and 284.2MB in the end (delta: 78.6MB). Free memory was 179.9MB in the beginning and 257.7MB in the end (delta: -77.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.06ms. Allocated memory is still 284.2MB. Free memory was 257.7MB in the beginning and 255.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 275.97ms. Allocated memory is still 284.2MB. Free memory was 255.8MB in the beginning and 242.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 81567.78ms. Allocated memory is still 284.2MB. Free memory was 242.0MB in the beginning and 195.6MB in the end (delta: 46.4MB). Peak memory consumption was 47.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: 81.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 83 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 80 NumberOfFragments, 173 HoareAnnotationTreeSize, 54 FomulaSimplifications, 113 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && N_COL == 1) && j == 0) && k == 1) && N_LIN == 1) || (((k == 0 && N_COL == 1) && j == 0) && N_LIN == 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((N_COL == 1 && j == 0) && N_LIN == 1) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && j == 1) && N_COL == 1) && k == 1) && N_LIN == 1) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 05:43:18,229 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-15 05:43:18,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...