/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:19,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:19,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:19,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:19,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:19,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:19,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:19,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:19,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:19,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:19,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:19,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:19,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:19,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:19,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:19,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:19,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:19,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:19,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:19,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:19,798 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:19,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:19,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:19,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:19,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:19,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:19,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:19,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:19,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:19,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:19,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:19,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:19,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:19,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:19,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:19,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:19,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:19,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:19,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:19,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:19,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:19,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:19,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:56:19,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:19,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:19,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:19,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:19,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:19,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:19,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:19,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:19,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:19,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:19,831 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:19,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:19,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:19,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:19,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:19,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:19,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:19,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:19,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:19,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:19,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:19,835 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:19,835 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 15:56:20,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:20,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:20,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:20,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:20,133 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:20,135 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-27 15:56:20,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba202f033/a28493e6d7a94bb4aff6a540621c72c9/FLAG808bbbbca [2022-04-27 15:56:20,588 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:20,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-27 15:56:20,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba202f033/a28493e6d7a94bb4aff6a540621c72c9/FLAG808bbbbca [2022-04-27 15:56:21,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba202f033/a28493e6d7a94bb4aff6a540621c72c9 [2022-04-27 15:56:21,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:21,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:21,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:21,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:21,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:21,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a123a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21, skipping insertion in model container [2022-04-27 15:56:21,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:21,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:21,236 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-27 15:56:21,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:21,313 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:21,325 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-27 15:56:21,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:21,359 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:21,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21 WrapperNode [2022-04-27 15:56:21,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:21,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:21,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:21,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:21,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:21,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:21,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:21,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:21,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:21,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:21,425 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-27 15:56:21,431 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-27 15:56:21,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:21,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:21,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:21,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:21,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:21,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:21,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:21,508 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:21,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:21,764 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:21,770 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:21,771 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 15:56:21,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:21 BoogieIcfgContainer [2022-04-27 15:56:21,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:21,773 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:21,773 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:21,775 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:21,782 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:21" (1/1) ... [2022-04-27 15:56:21,784 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:21,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:21 BasicIcfg [2022-04-27 15:56:21,825 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:21,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:21,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:21,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:21,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:21" (1/4) ... [2022-04-27 15:56:21,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e26c492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:21, skipping insertion in model container [2022-04-27 15:56:21,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:21" (2/4) ... [2022-04-27 15:56:21,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e26c492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:21, skipping insertion in model container [2022-04-27 15:56:21,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:21" (3/4) ... [2022-04-27 15:56:21,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e26c492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:21, skipping insertion in model container [2022-04-27 15:56:21,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:21" (4/4) ... [2022-04-27 15:56:21,836 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.cJordan [2022-04-27 15:56:21,851 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:21,851 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:21,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:21,905 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ee4367f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@175f17c6 [2022-04-27 15:56:21,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:21,915 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-27 15:56:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:21,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:21,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:21,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1279400997, now seen corresponding path program 1 times [2022-04-27 15:56:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:21,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089981418] [2022-04-27 15:56:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:22,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:22,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788946790] [2022-04-27 15:56:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:22,075 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-27 15:56:22,076 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-27 15:56:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:22,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 15:56:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:22,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:22,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:22,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-27 15:56:22,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:22,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:22,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 15:56:22,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {27#true} is VALID [2022-04-27 15:56:22,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [65] L21-3-->L21-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 15:56:22,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {28#false} is VALID [2022-04-27 15:56:22,267 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {28#false} is VALID [2022-04-27 15:56:22,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-27 15:56:22,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 15:56:22,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 15:56:22,271 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-27 15:56:22,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:22,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089981418] [2022-04-27 15:56:22,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:22,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788946790] [2022-04-27 15:56:22,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788946790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:22,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:22,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 15:56:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489702376] [2022-04-27 15:56:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:22,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:22,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,310 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-27 15:56:22,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 15:56:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:22,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 15:56:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 15:56:22,339 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,388 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 15:56:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 15:56:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2022-04-27 15:56:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2022-04-27 15:56:22,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 29 transitions. [2022-04-27 15:56:22,444 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-27 15:56:22,452 INFO L225 Difference]: With dead ends: 24 [2022-04-27 15:56:22,452 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 15:56:22,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 15:56:22,457 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:22,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 15:56:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 15:56:22,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:22,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 15:56:22,479 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 15:56:22,480 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 15:56:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,482 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 15:56:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 15:56:22,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:22,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:22,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-27 15:56:22,484 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-27 15:56:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,486 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 15:56:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 15:56:22,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:22,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:22,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:22,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 15:56:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 15:56:22,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-27 15:56:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:22,491 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 15:56:22,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-27 15:56:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 15:56:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:22,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:22,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:22,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 15:56:22,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 15:56:22,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1308030148, now seen corresponding path program 1 times [2022-04-27 15:56:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187758212] [2022-04-27 15:56:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:22,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:22,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583000959] [2022-04-27 15:56:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:22,743 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-27 15:56:22,748 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-27 15:56:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:22,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 15:56:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:22,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:22,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 15:56:22,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {139#true} is VALID [2022-04-27 15:56:22,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 15:56:22,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 15:56:22,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 15:56:22,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {159#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:56:22,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {140#false} is VALID [2022-04-27 15:56:22,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {140#false} is VALID [2022-04-27 15:56:22,885 INFO L272 TraceCheckUtils]: 8: Hoare triple {140#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {140#false} is VALID [2022-04-27 15:56:22,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {140#false} is VALID [2022-04-27 15:56:22,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {140#false} is VALID [2022-04-27 15:56:22,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#false} is VALID [2022-04-27 15:56:22,886 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-27 15:56:22,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:22,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187758212] [2022-04-27 15:56:22,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:22,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583000959] [2022-04-27 15:56:22,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583000959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:22,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:22,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061647803] [2022-04-27 15:56:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:22,889 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-27 15:56:22,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:22,889 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-27 15:56:22,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:22,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:22,903 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. 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-27 15:56:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,949 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 15:56:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:22,949 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-27 15:56:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:22,950 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-27 15:56:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-27 15:56:22,951 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-27 15:56:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-27 15:56:22,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-27 15:56:22,979 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-27 15:56:22,980 INFO L225 Difference]: With dead ends: 22 [2022-04-27 15:56:22,980 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 15:56:22,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:22,982 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 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-27 15:56:22,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 15:56:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-27 15:56:22,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:22,985 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-27 15:56:22,985 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-27 15:56:22,986 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-27 15:56:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,987 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 15:56:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 15:56:22,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:22,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:22,988 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-27 15:56:22,989 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-27 15:56:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,990 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 15:56:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 15:56:22,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:22,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:22,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:22,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:22,991 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-27 15:56:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 15:56:22,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-27 15:56:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:22,993 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 15:56:22,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 15:56:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 15:56:22,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:22,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:23,018 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-27 15:56:23,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 15:56:23,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1527308084, now seen corresponding path program 1 times [2022-04-27 15:56:23,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:23,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526083150] [2022-04-27 15:56:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:23,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:23,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542068770] [2022-04-27 15:56:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:23,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:23,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:23,244 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-27 15:56:23,270 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-27 15:56:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:23,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 15:56:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:23,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:23,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {261#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#true} is VALID [2022-04-27 15:56:23,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {261#true} is VALID [2022-04-27 15:56:23,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#true} is VALID [2022-04-27 15:56:23,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#true} is VALID [2022-04-27 15:56:23,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {261#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#true} is VALID [2022-04-27 15:56:23,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {281#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:56:23,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {285#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:56:23,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {262#false} is VALID [2022-04-27 15:56:23,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {262#false} is VALID [2022-04-27 15:56:23,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {262#false} is VALID [2022-04-27 15:56:23,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {262#false} is VALID [2022-04-27 15:56:23,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {262#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {262#false} is VALID [2022-04-27 15:56:23,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {262#false} is VALID [2022-04-27 15:56:23,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {262#false} is VALID [2022-04-27 15:56:23,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#false} is VALID [2022-04-27 15:56:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:23,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526083150] [2022-04-27 15:56:23,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:23,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542068770] [2022-04-27 15:56:23,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542068770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:23,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:23,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:56:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68504195] [2022-04-27 15:56:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:23,409 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-27 15:56:23,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:23,409 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-27 15:56:23,422 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-27 15:56:23,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:56:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:23,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:56:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:56:23,424 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-27 15:56:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:23,510 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 15:56:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:56:23,510 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-27 15:56:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:23,510 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-27 15:56:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 15:56:23,512 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-27 15:56:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 15:56:23,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-27 15:56:23,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:23,547 INFO L225 Difference]: With dead ends: 25 [2022-04-27 15:56:23,548 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 15:56:23,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:23,551 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:23,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 15:56:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-27 15:56:23,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:23,560 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-27 15:56:23,562 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-27 15:56:23,562 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-27 15:56:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:23,565 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 15:56:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-27 15:56:23,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:23,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:23,565 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-27 15:56:23,566 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-27 15:56:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:23,569 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 15:56:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-27 15:56:23,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:23,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:23,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:23,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:23,571 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-27 15:56:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 15:56:23,576 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-27 15:56:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:23,576 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 15:56:23,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 15:56:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:56:23,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:23,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:23,608 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-27 15:56:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:23,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash 990414767, now seen corresponding path program 1 times [2022-04-27 15:56:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:23,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002201337] [2022-04-27 15:56:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:23,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:23,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850230277] [2022-04-27 15:56:23,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:23,819 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-27 15:56:23,824 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-27 15:56:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:23,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 15:56:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:23,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:26,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-04-27 15:56:26,737 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-27 15:56:26,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:26,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {405#true} is VALID [2022-04-27 15:56:26,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:26,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:26,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:26,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {425#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:56:26,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {429#(and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:56:26,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {429#(and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:56:26,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (let ((.cse0 (mod v_main_~k~0_5 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) (* (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (* (let ((.cse2 (mod v_main_~N_LIN~0_4 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {436#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:56:26,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {436#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:56:26,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {436#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:56:26,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {446#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} is VALID [2022-04-27 15:56:26,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {450#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:56:26,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {450#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {454#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 15:56:26,835 INFO L272 TraceCheckUtils]: 14: Hoare triple {454#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {458#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:56:26,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {462#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:56:26,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {462#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-27 15:56:26,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {406#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-27 15:56:26,837 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-27 15:56:26,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:30,000 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 15:56:30,630 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-27 15:56:30,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:30,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-27 15:56:30,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-27 15:56:30,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:30,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 15:56:30,787 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-27 15:56:30,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:30,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-04-27 15:56:30,837 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-27 15:56:30,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:30,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-27 15:56:30,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-04-27 15:56:30,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:30,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-27 15:56:30,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-27 15:56:31,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:31,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 15:56:31,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:56:31,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-04-27 15:56:31,993 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 15:56:32,227 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-04-27 15:56:32,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 3 [2022-04-27 15:56:32,285 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-27 15:56:32,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 3 [2022-04-27 15:56:32,568 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-04-27 15:56:32,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-04-27 15:56:32,745 INFO L356 Elim1Store]: treesize reduction 6, result has 73.9 percent of original size [2022-04-27 15:56:32,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-27 15:56:32,767 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 15:56:32,789 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-04-27 15:56:32,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 3 [2022-04-27 15:56:37,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {406#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-27 15:56:37,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {462#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-27 15:56:37,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {462#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:56:37,677 INFO L272 TraceCheckUtils]: 14: Hoare triple {454#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {458#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:56:37,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {450#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {454#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 15:56:37,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {450#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:56:37,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {484#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {488#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {488#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#(or (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|))))))))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (let ((.cse0 (mod v_main_~k~0_5 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) (* (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (* (let ((.cse2 (mod v_main_~N_LIN~0_4 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {488#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(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)))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {498#(or (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|))))))))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(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))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {502#(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)))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {506#(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))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:37,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:37,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:37,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:37,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {405#true} is VALID [2022-04-27 15:56:37,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 15:56:37,776 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-27 15:56:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:37,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002201337] [2022-04-27 15:56:37,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:37,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850230277] [2022-04-27 15:56:37,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850230277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:37,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 15:56:37,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2022-04-27 15:56:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130972318] [2022-04-27 15:56:37,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:56:37,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:37,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:56:38,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:38,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 15:56:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 15:56:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-27 15:56:38,145 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:56:44,385 WARN L232 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 112 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 15:57:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:06,268 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-27 15:57:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 15:57:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:57:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:57:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2022-04-27 15:57:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:57:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2022-04-27 15:57:06,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 66 transitions. [2022-04-27 15:57:06,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:06,810 INFO L225 Difference]: With dead ends: 51 [2022-04-27 15:57:06,810 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 15:57:06,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=198, Invalid=671, Unknown=1, NotChecked=0, Total=870 [2022-04-27 15:57:06,812 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:06,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 87 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 15:57:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 15:57:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-27 15:57:06,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:06,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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-27 15:57:06,816 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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-27 15:57:06,816 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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-27 15:57:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:06,819 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-27 15:57:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-04-27 15:57:06,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:06,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:06,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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 43 states. [2022-04-27 15:57:06,820 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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 43 states. [2022-04-27 15:57:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:06,822 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-27 15:57:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-04-27 15:57:06,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:06,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:06,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:06,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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-27 15:57:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-04-27 15:57:06,825 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2022-04-27 15:57:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:06,825 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-04-27 15:57:06,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-27 15:57:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-27 15:57:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:57:06,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:06,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:06,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 15:57:07,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:07,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 793901262, now seen corresponding path program 1 times [2022-04-27 15:57:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:07,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146911540] [2022-04-27 15:57:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:07,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:57:07,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950631106] [2022-04-27 15:57:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:57:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:07,044 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-27 15:57:07,060 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-27 15:57:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:07,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 15:57:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:07,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:57:07,439 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-27 15:57:07,532 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-27 15:57:07,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:57:07,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {725#true} is VALID [2022-04-27 15:57:07,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:57:07,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:57:07,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:57:07,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {745#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:57:07,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {749#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 15:57:07,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {753#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} is VALID [2022-04-27 15:57:07,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {753#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:57:07,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:57:07,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:57:07,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:57:07,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:57:07,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {757#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {773#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 15:57:07,613 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(< |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:57:07,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:57:07,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {726#false} is VALID [2022-04-27 15:57:07,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {726#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#false} is VALID [2022-04-27 15:57:07,614 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-27 15:57:07,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:57:08,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-04-27 15:57:08,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:57:08,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-27 15:57:08,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-27 15:57:09,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:57:09,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 15:57:09,039 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 15:57:09,058 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-27 15:57:09,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:57:09,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-27 15:57:09,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-27 15:57:09,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:57:09,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 15:57:09,141 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-27 15:57:09,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:57:09,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-04-27 15:57:09,186 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-27 15:57:09,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 15:57:09,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-27 15:57:19,143 WARN L232 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 181 DAG size of output: 105 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-27 15:57:19,182 INFO L356 Elim1Store]: treesize reduction 1115, result has 20.9 percent of original size [2022-04-27 15:57:19,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 294 treesize of output 429 [2022-04-27 15:58:18,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {726#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#false} is VALID [2022-04-27 15:58:18,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {726#false} is VALID [2022-04-27 15:58:18,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:58:18,264 INFO L272 TraceCheckUtils]: 14: Hoare triple {797#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:58:18,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {797#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 15:58:18,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:58:18,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:58:18,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:58:18,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:58:18,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {817#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {801#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 15:58:18,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {821#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (<= (mod main_~j~0 4294967296) 2147483647)) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (mod main_~k~0 4294967296) 2147483647))))} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {817#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} is VALID [2022-04-27 15:58:18,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {825#(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))))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {821#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (<= (mod main_~j~0 4294967296) 2147483647)) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (mod main_~k~0 4294967296) 2147483647))))} is VALID [2022-04-27 15:58:18,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {825#(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-27 15:58:18,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:58:18,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:58:18,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:58:18,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {725#true} is VALID [2022-04-27 15:58:18,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#true} is VALID [2022-04-27 15:58:18,294 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-27 15:58:18,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:58:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146911540] [2022-04-27 15:58:18,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:58:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950631106] [2022-04-27 15:58:18,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950631106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:58:18,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 15:58:18,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-27 15:58:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563455341] [2022-04-27 15:58:18,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 15:58:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:58:18,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:58:18,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:18,342 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-27 15:58:18,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 15:58:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:58:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 15:58:18,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-27 15:58:18,344 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:28,081 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-27 15:58:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 15:58:28,082 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:58:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:58:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-27 15:58:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-27 15:58:28,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-27 15:58:28,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:58:28,202 INFO L225 Difference]: With dead ends: 50 [2022-04-27 15:58:28,202 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 15:58:28,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2022-04-27 15:58:28,203 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:58:28,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 15:58:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 15:58:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-04-27 15:58:28,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:58:28,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-27 15:58:28,207 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-27 15:58:28,207 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-27 15:58:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:28,209 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-27 15:58:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-27 15:58:28,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:28,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:58:28,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 46 states. [2022-04-27 15:58:28,210 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 46 states. [2022-04-27 15:58:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:28,212 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-27 15:58:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-27 15:58:28,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:28,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:58:28,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:58:28,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:58:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-27 15:58:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-27 15:58:28,214 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2022-04-27 15:58:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:58:28,214 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-27 15:58:28,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 15:58:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:58:28,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:58:28,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:58:28,236 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-27 15:58:28,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:58:28,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:58:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:58:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 870630741, now seen corresponding path program 1 times [2022-04-27 15:58:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:58:28,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770155578] [2022-04-27 15:58:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:58:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:58:28,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:58:28,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220657764] [2022-04-27 15:58:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:58:28,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:58:28,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:58:28,480 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-27 15:58:28,482 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-27 15:58:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:58:28,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 15:58:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:58:28,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:58:28,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {1051#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1051#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1051#true} is VALID [2022-04-27 15:58:28,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:58:28,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:58:28,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:58:28,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:58:28,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:58:28,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 15:58:28,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1090#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} is VALID [2022-04-27 15:58:28,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1052#false} is VALID [2022-04-27 15:58:28,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {1052#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {1052#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1052#false} is VALID [2022-04-27 15:58:28,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#false} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1052#false} is VALID [2022-04-27 15:58:28,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#false} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1052#false} is VALID [2022-04-27 15:58:28,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#false} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (let ((.cse0 (mod v_main_~k~0_5 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) (* (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (* (let ((.cse2 (mod v_main_~N_LIN~0_4 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1052#false} is VALID [2022-04-27 15:58:28,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#false} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1052#false} is VALID [2022-04-27 15:58:28,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {1052#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {1052#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1052#false} is VALID [2022-04-27 15:58:28,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {1052#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {1052#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1052#false} is VALID [2022-04-27 15:58:28,659 INFO L272 TraceCheckUtils]: 23: Hoare triple {1052#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1052#false} is VALID [2022-04-27 15:58:28,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#false} is VALID [2022-04-27 15:58:28,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1052#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {1052#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 15:58:28,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:58:28,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {1052#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {1052#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#false} is VALID [2022-04-27 15:58:28,773 INFO L272 TraceCheckUtils]: 23: Hoare triple {1052#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1052#false} is VALID [2022-04-27 15:58:28,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {1052#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1052#false} is VALID [2022-04-27 15:58:28,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {1052#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {1052#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1052#false} is VALID [2022-04-27 15:58:28,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {1052#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#false} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1052#false} is VALID [2022-04-27 15:58:28,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#false} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (let ((.cse0 (mod v_main_~k~0_5 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) (* (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) (* (let ((.cse2 (mod v_main_~N_LIN~0_4 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1052#false} is VALID [2022-04-27 15:58:28,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#false} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1052#false} is VALID [2022-04-27 15:58:28,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#false} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1052#false} is VALID [2022-04-27 15:58:28,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1052#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1052#false} is VALID [2022-04-27 15:58:28,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {1052#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1052#false} is VALID [2022-04-27 15:58:28,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1052#false} is VALID [2022-04-27 15:58:28,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1178#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [71] L22-3-->L26: Formula: (let ((.cse0 (mod v_main_~k~0_4 4294967296)) (.cse1 (mod v_main_~N_LIN~0_3 4294967296))) (let ((.cse2 (+ (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4) (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse3 (mod v_main_~j~0_5 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296))))) |v_main_~#matriz~0.offset_5|))) (and (< .cse0 .cse1) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2)) (<= |v_main_#t~nondet7_2| 2147483647)))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1182#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:58:28,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {1051#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1051#true} is VALID [2022-04-27 15:58:28,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {1051#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#true} is VALID [2022-04-27 15:58:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 15:58:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:58:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770155578] [2022-04-27 15:58:28,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:58:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220657764] [2022-04-27 15:58:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220657764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:58:28,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 15:58:28,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-27 15:58:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095445281] [2022-04-27 15:58:28,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 15:58:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 27 [2022-04-27 15:58:28,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:58:28,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-27 15:58:28,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:58:28,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:58:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:58:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:58:28,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:58:28,818 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-27 15:58:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:28,865 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 15:58:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:58:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 27 [2022-04-27 15:58:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:58:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-27 15:58:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 15:58:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-27 15:58:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 15:58:28,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-04-27 15:58:28,887 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-27 15:58:28,887 INFO L225 Difference]: With dead ends: 14 [2022-04-27 15:58:28,887 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:58:28,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-27 15:58:28,888 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:58:28,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:58:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:58:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:58:28,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:58:28,889 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-27 15:58:28,889 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-27 15:58:28,889 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-27 15:58:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:28,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:58:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:58:28,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:28,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:58:28,890 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-27 15:58:28,890 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-27 15:58:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:28,890 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:58:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:58:28,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:28,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:58:28,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:58:28,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:58:28,890 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-27 15:58:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:58:28,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-04-27 15:58:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:58:28,891 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:58:28,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-27 15:58:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:58:28,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:28,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:58:28,919 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-27 15:58:29,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:58:29,111 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 15:58:29,113 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:58:29,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:58:29 BasicIcfg [2022-04-27 15:58:29,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:58:29,120 INFO L158 Benchmark]: Toolchain (without parser) took 128109.43ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 113.3MB in the beginning and 113.6MB in the end (delta: -287.1kB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2022-04-27 15:58:29,120 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:58:29,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.98ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 113.1MB in the beginning and 209.3MB in the end (delta: -96.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 15:58:29,120 INFO L158 Benchmark]: Boogie Preprocessor took 36.65ms. Allocated memory is still 237.0MB. Free memory was 208.7MB in the beginning and 207.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:58:29,121 INFO L158 Benchmark]: RCFGBuilder took 374.94ms. Allocated memory is still 237.0MB. Free memory was 207.2MB in the beginning and 193.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 15:58:29,121 INFO L158 Benchmark]: IcfgTransformer took 52.02ms. Allocated memory is still 237.0MB. Free memory was 193.5MB in the beginning and 192.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:58:29,122 INFO L158 Benchmark]: TraceAbstraction took 127289.85ms. Allocated memory is still 237.0MB. Free memory was 191.4MB in the beginning and 113.6MB in the end (delta: 77.9MB). Peak memory consumption was 78.9MB. Max. memory is 8.0GB. [2022-04-27 15:58:29,123 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.19ms. Allocated memory is still 169.9MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 349.98ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 113.1MB in the beginning and 209.3MB in the end (delta: -96.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.65ms. Allocated memory is still 237.0MB. Free memory was 208.7MB in the beginning and 207.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 374.94ms. Allocated memory is still 237.0MB. Free memory was 207.2MB in the beginning and 193.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 52.02ms. Allocated memory is still 237.0MB. Free memory was 193.5MB in the beginning and 192.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 127289.85ms. Allocated memory is still 237.0MB. Free memory was 191.4MB in the beginning and 113.6MB in the end (delta: 77.9MB). Peak memory consumption was 78.9MB. 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 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 127.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 82 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 39.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, InterpolantAutomatonStates: 58, 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, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 85.6s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1163 SizeOfPredicates, 31 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 41/51 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:58:29,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...