/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:42:03,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:42:03,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:42:03,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:42:03,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:42:03,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:42:03,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:42:03,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:42:03,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:42:03,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:42:03,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:42:03,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:42:03,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:42:03,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:42:03,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:42:03,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:42:03,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:42:03,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:42:03,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:42:03,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:42:03,389 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:42:03,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:42:03,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:42:03,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:42:03,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:42:03,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:42:03,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:42:03,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:42:03,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:42:03,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:42:03,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:42:03,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:42:03,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:42:03,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:42:03,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:42:03,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:42:03,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:42:03,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:42:03,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:42:03,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:42:03,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:42:03,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:42:03,404 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:42:03,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:42:03,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:42:03,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:42:03,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:42:03,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:42:03,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:42:03,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:42:03,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:42:03,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:42:03,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:42:03,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:42:03,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:42:03,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:42:03,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:42:03,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:42:03,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:42:03,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:42:03,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:42:03,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:03,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:42:03,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:42:03,417 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:42:03,417 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:42:03,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:42:03,417 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:42:03,418 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:42:03,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:42:03,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:42:03,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:42:03,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:42:03,655 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:42:03,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-2.c [2022-04-15 05:42:03,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4cd2a18/269a805817804342ad35a04dfee180d5/FLAGa711dec6d [2022-04-15 05:42:04,100 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:42:04,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2022-04-15 05:42:04,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4cd2a18/269a805817804342ad35a04dfee180d5/FLAGa711dec6d [2022-04-15 05:42:04,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4cd2a18/269a805817804342ad35a04dfee180d5 [2022-04-15 05:42:04,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:42:04,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:42:04,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:04,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:42:04,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:42:04,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b2a2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04, skipping insertion in model container [2022-04-15 05:42:04,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:42:04,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:42:04,688 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-2.c[320,333] [2022-04-15 05:42:04,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:04,720 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:42:04,730 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-2.c[320,333] [2022-04-15 05:42:04,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:04,758 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:42:04,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04 WrapperNode [2022-04-15 05:42:04,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:04,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:42:04,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:42:04,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:42:04,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:42:04,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:42:04,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:42:04,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:42:04,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (1/1) ... [2022-04-15 05:42:04,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:04,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:04,844 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:42:04,849 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:42:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:42:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:42:04,876 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:42:04,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:42:04,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:42:04,876 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:42:04,876 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:42:04,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:42:04,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:42:04,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:42:04,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:42:04,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:42:04,932 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:42:04,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:42:05,116 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:42:05,122 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:42:05,123 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 05:42:05,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:05 BoogieIcfgContainer [2022-04-15 05:42:05,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:42:05,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:42:05,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:42:05,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:42:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:42:04" (1/3) ... [2022-04-15 05:42:05,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c829711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:05, skipping insertion in model container [2022-04-15 05:42:05,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:04" (2/3) ... [2022-04-15 05:42:05,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c829711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:05, skipping insertion in model container [2022-04-15 05:42:05,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:05" (3/3) ... [2022-04-15 05:42:05,132 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-2.c [2022-04-15 05:42:05,136 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:42:05,136 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:42:05,173 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:42:05,178 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:42:05,179 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:42:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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:42:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:42:05,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:05,216 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:05,217 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash -691068696, now seen corresponding path program 1 times [2022-04-15 05:42:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:05,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284387966] [2022-04-15 05:42:05,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -691068696, now seen corresponding path program 2 times [2022-04-15 05:42:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42561303] [2022-04-15 05:42:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:05,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:42:05,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483983703] [2022-04-15 05:42:05,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:05,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:05,407 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:42:05,454 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:42:05,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:42:05,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:05,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:42:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:05,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:05,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2022-04-15 05:42:05,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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); {32#true} is VALID [2022-04-15 05:42:05,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 05:42:05,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #82#return; {32#true} is VALID [2022-04-15 05:42:05,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret15 := main(); {32#true} is VALID [2022-04-15 05:42:05,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} ~N_LIN~0 := #t~nondet4;havoc #t~nondet4;~N_COL~0 := #t~nondet5;havoc #t~nondet5;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~nondet6 && #t~nondet6 <= 2147483647;~maior~0 := #t~nondet6;havoc #t~nondet6;~j~0 := 0; {52#(= main_~j~0 0)} is VALID [2022-04-15 05:42:05,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {52#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {56#(not (< 0 (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-15 05:42:05,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {56#(not (< 0 (mod main_~N_COL~0 4294967296)))} ~j~0 := 0; {60#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-15 05:42:05,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {33#false} is VALID [2022-04-15 05:42:05,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem14 := 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); {33#false} is VALID [2022-04-15 05:42:05,707 INFO L272 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem14 < ~maior~0 then 1 else 0)); {33#false} is VALID [2022-04-15 05:42:05,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 05:42:05,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 05:42:05,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 05:42:05,709 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:05,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:42:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42561303] [2022-04-15 05:42:05,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:42:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483983703] [2022-04-15 05:42:05,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483983703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:05,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:05,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:05,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:05,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284387966] [2022-04-15 05:42:05,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284387966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:05,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:05,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743029038] [2022-04-15 05:42:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 05:42:05,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:05,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:05,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:05,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:42:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:42:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:42:05,787 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:05,983 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2022-04-15 05:42:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:42:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 05:42:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-15 05:42:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-15 05:42:05,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-15 05:42:06,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:06,092 INFO L225 Difference]: With dead ends: 68 [2022-04-15 05:42:06,092 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 05:42:06,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:42:06,097 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:06,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 05:42:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-15 05:42:06,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:06,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 25 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:06,122 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 25 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:06,122 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 25 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:06,126 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 05:42:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 05:42:06,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:06,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:06,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 05:42:06,128 INFO L87 Difference]: Start difference. First operand has 25 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 05:42:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:06,131 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 05:42:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 05:42:06,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:06,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:06,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:06,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 05:42:06,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-15 05:42:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:06,138 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 05:42:06,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:06,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-15 05:42:06,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 05:42:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:42:06,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:06,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:06,205 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:42:06,388 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:42:06,389 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1002836895, now seen corresponding path program 1 times [2022-04-15 05:42:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:06,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15975510] [2022-04-15 05:42:09,546 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:42:09,870 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:09,873 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1825472399, now seen corresponding path program 1 times [2022-04-15 05:42:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:09,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101239056] [2022-04-15 05:42:09,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:09,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:42:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679359529] [2022-04-15 05:42:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:09,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:09,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:09,915 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:09,917 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:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:09,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:42:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:09,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:11,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-15 05:42:11,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#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); {334#true} is VALID [2022-04-15 05:42:11,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 05:42:11,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #82#return; {334#true} is VALID [2022-04-15 05:42:11,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret15 := main(); {334#true} is VALID [2022-04-15 05:42:11,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} ~N_LIN~0 := #t~nondet4;havoc #t~nondet4;~N_COL~0 := #t~nondet5;havoc #t~nondet5;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~nondet6 && #t~nondet6 <= 2147483647;~maior~0 := #t~nondet6;havoc #t~nondet6;~j~0 := 0; {354#(= main_~j~0 0)} is VALID [2022-04-15 05:42:11,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#(= main_~j~0 0)} [86] L22-3-->L22-4_primed: Formula: (let ((.cse5 (mod v_main_~N_COL~0_6 4294967296))) (let ((.cse0 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse1 (= v_main_~k~0_14 v_main_~k~0_13)) (.cse4 (= v_main_~j~0_16 v_main_~j~0_15)) (.cse3 (< (mod v_main_~j~0_16 4294967296) .cse5)) (.cse2 (<= (mod v_main_~N_LIN~0_7 4294967296) 0))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse0 .cse1 (= v_main_~N_COL~0_6 v_main_~N_COL~0_6) (= v_main_~N_LIN~0_7 v_main_~N_LIN~0_7) .cse4) (and (< v_main_~j~0_16 v_main_~j~0_15) .cse3 (<= (div (+ .cse5 (* v_main_~j~0_15 (- 1))) (- 4294967296)) (+ (div (+ v_main_~j~0_16 (- 4294967295)) 4294967296) 1)) (= v_main_~k~0_13 0) .cse2)))) InVars {main_~N_COL~0=v_main_~N_COL~0_6, main_~N_LIN~0=v_main_~N_LIN~0_7, main_~k~0=v_main_~k~0_14, main_~j~0=v_main_~j~0_16, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~N_COL~0=v_main_~N_COL~0_6, main_~N_LIN~0=v_main_~N_LIN~0_7, main_~k~0=v_main_~k~0_13, main_~j~0=v_main_~j~0_15, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post7] {358#(or (= main_~j~0 0) (and (<= (mod main_~N_LIN~0 4294967296) 0) (<= (div (+ (mod main_~N_COL~0 4294967296) (* (- 1) main_~j~0)) (- 4294967296)) 0) (< 0 main_~j~0)))} is VALID [2022-04-15 05:42:11,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#(or (= main_~j~0 0) (and (<= (mod main_~N_LIN~0 4294967296) 0) (<= (div (+ (mod main_~N_COL~0 4294967296) (* (- 1) main_~j~0)) (- 4294967296)) 0) (< 0 main_~j~0)))} [85] L22-4_primed-->L22-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~N_COL~0_3 4294967296))) InVars {main_~j~0=v_main_~j~0_5, main_~N_COL~0=v_main_~N_COL~0_3} OutVars{main_~j~0=v_main_~j~0_5, main_~N_COL~0=v_main_~N_COL~0_3} AuxVars[] AssignedVars[] {362#(or (< 0 (+ (div (- (mod main_~N_COL~0 4294967296)) 4294967296) 1)) (<= (mod main_~N_LIN~0 4294967296) 0))} is VALID [2022-04-15 05:42:11,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(or (< 0 (+ (div (- (mod main_~N_COL~0 4294967296)) 4294967296) 1)) (<= (mod main_~N_LIN~0 4294967296) 0))} ~j~0 := 0; {366#(and (= main_~j~0 0) (or (< 0 (+ (div (- (mod main_~N_COL~0 4294967296)) 4294967296) 1)) (<= (mod main_~N_LIN~0 4294967296) 0)))} is VALID [2022-04-15 05:42:11,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {366#(and (= main_~j~0 0) (or (< 0 (+ (div (- (mod main_~N_COL~0 4294967296)) 4294967296) 1)) (<= (mod main_~N_LIN~0 4294967296) 0)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {370#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2022-04-15 05:42:11,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem14 := 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); {335#false} is VALID [2022-04-15 05:42:11,144 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem14 < ~maior~0 then 1 else 0)); {335#false} is VALID [2022-04-15 05:42:11,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 05:42:11,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 05:42:11,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 05:42:11,145 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:11,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:42:11,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:11,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101239056] [2022-04-15 05:42:11,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 05:42:11,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679359529] [2022-04-15 05:42:11,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679359529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:11,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:11,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:42:12,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:12,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15975510] [2022-04-15 05:42:12,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15975510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:12,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:12,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476548569] [2022-04-15 05:42:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-15 05:42:12,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:12,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:12,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:12,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:12,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:12,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:42:12,181 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:12,837 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-04-15 05:42:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:42:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-15 05:42:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-15 05:42:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-15 05:42:12,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-15 05:42:12,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:12,961 INFO L225 Difference]: With dead ends: 63 [2022-04-15 05:42:12,961 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:42:12,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:42:12,962 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:12,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:42:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:42:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-15 05:42:12,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:12,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:12,977 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:12,977 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:12,980 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 05:42:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 05:42:12,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:12,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:12,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 05:42:12,981 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 05:42:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:12,983 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 05:42:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 05:42:12,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:12,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:12,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:12,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:42:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 05:42:12,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-04-15 05:42:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:12,987 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 05:42:12,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:12,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 05:42:13,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 05:42:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:42:13,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:13,018 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:13,048 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:13,243 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:13,243 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash -230396703, now seen corresponding path program 1 times [2022-04-15 05:42:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:13,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032881921] [2022-04-15 05:42:23,335 WARN L232 SmtUtils]: Spent 5.93s 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:42:23,376 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:23,376 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:25,754 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:25,755 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:25,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -230396703, now seen corresponding path program 2 times [2022-04-15 05:42:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:25,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316079825] [2022-04-15 05:42:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:25,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 05:42:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937001786] [2022-04-15 05:42:25,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:25,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:25,778 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:25,821 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:25,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:25,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 05:42:25,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:42:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:25,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:42:25,906 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 05:42:25,906 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 05:42:25,909 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:42:25,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 05:42:26,143 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:26,146 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 05:42:26,149 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:42:26,160 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:26,160 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 05:42:26,160 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:42:26,161 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-04-15 05:42:26,162 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-15 05:42:26,163 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:42:26,163 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:42:26,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:42:26 BoogieIcfgContainer [2022-04-15 05:42:26,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:42:26,167 INFO L158 Benchmark]: Toolchain (without parser) took 21650.25ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 137.7MB in the beginning and 167.1MB in the end (delta: -29.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-15 05:42:26,167 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:26,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.63ms. Allocated memory is still 184.5MB. Free memory was 137.6MB in the beginning and 163.3MB in the end (delta: -25.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-15 05:42:26,168 INFO L158 Benchmark]: Boogie Preprocessor took 50.63ms. Allocated memory is still 184.5MB. Free memory was 163.3MB in the beginning and 161.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:42:26,168 INFO L158 Benchmark]: RCFGBuilder took 313.15ms. Allocated memory is still 184.5MB. Free memory was 161.2MB in the beginning and 147.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 05:42:26,169 INFO L158 Benchmark]: TraceAbstraction took 21039.93ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 146.6MB in the beginning and 167.1MB in the end (delta: -20.6MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-04-15 05:42:26,170 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.20ms. Allocated memory is still 184.5MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.63ms. Allocated memory is still 184.5MB. Free memory was 137.6MB in the beginning and 163.3MB in the end (delta: -25.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.63ms. Allocated memory is still 184.5MB. Free memory was 163.3MB in the beginning and 161.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.15ms. Allocated memory is still 184.5MB. Free memory was 161.2MB in the beginning and 147.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21039.93ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 146.6MB in the beginning and 167.1MB in the end (delta: -20.6MB). Peak memory consumption was 18.2MB. 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 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L17] unsigned int N_COL=__VERIFIER_nondet_uint(); [L18] unsigned int j,k; [L19] int matriz[N_COL][N_LIN], maior; [L21] maior = __VERIFIER_nondet_int() [L22] j=0 [L22] COND TRUE jmaior [L28] EXPR matriz[j][k] [L28] maior = matriz[j][k] [L23] k++ [L23] COND FALSE !(k