./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fa401c700a21fa1f98a1481c8e8ba1555a45c0429555dc041a1c04ce1059991 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:21:38,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:21:38,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:21:38,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:21:38,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:21:38,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:21:38,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:21:38,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:21:38,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:21:38,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:21:38,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:21:38,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:21:38,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:21:38,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:21:38,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:21:38,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:21:38,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:21:38,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:21:38,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:21:38,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:21:38,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:21:38,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:21:38,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:21:38,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:21:38,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:21:38,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:21:38,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:21:38,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:21:38,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:21:38,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:21:38,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:21:38,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:21:38,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:21:38,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:21:38,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:21:38,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:21:38,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:21:38,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:21:38,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:21:38,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:21:38,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:21:38,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:21:38,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:21:38,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:21:38,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:21:38,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:21:38,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:21:38,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:21:38,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:21:38,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:21:38,305 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:21:38,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:21:38,307 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:21:38,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:21:38,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:21:38,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:21:38,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:21:38,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:21:38,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:21:38,308 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:21:38,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:21:38,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:21:38,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:21:38,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:21:38,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:21:38,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:21:38,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:21:38,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:21:38,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:21:38,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:21:38,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:21:38,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:21:38,312 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:21:38,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:21:38,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:21:38,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fa401c700a21fa1f98a1481c8e8ba1555a45c0429555dc041a1c04ce1059991 [2022-02-20 14:21:38,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:21:38,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:21:38,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:21:38,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:21:38,559 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:21:38,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c [2022-02-20 14:21:38,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b6be0a2/dcfb99787c0a424fac2f3265573c0185/FLAG28ac41109 [2022-02-20 14:21:39,008 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:21:39,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c [2022-02-20 14:21:39,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b6be0a2/dcfb99787c0a424fac2f3265573c0185/FLAG28ac41109 [2022-02-20 14:21:39,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b6be0a2/dcfb99787c0a424fac2f3265573c0185 [2022-02-20 14:21:39,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:21:39,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:21:39,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:21:39,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:21:39,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:21:39,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee590a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39, skipping insertion in model container [2022-02-20 14:21:39,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:21:39,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:21:39,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c[421,434] [2022-02-20 14:21:39,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:21:39,672 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:21:39,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c[421,434] [2022-02-20 14:21:39,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:21:39,730 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:21:39,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39 WrapperNode [2022-02-20 14:21:39,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:21:39,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:21:39,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:21:39,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:21:39,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,776 INFO L137 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2022-02-20 14:21:39,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:21:39,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:21:39,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:21:39,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:21:39,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:21:39,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:21:39,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:21:39,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:21:39,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (1/1) ... [2022-02-20 14:21:39,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:21:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:39,853 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-02-20 14:21:39,856 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-02-20 14:21:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:21:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:21:39,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:21:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:21:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:21:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:21:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:21:39,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:21:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:21:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:21:39,949 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:21:39,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:21:40,100 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:21:40,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:21:40,106 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:21:40,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:21:40 BoogieIcfgContainer [2022-02-20 14:21:40,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:21:40,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:21:40,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:21:40,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:21:40,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:21:39" (1/3) ... [2022-02-20 14:21:40,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a44a614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:21:40, skipping insertion in model container [2022-02-20 14:21:40,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:21:39" (2/3) ... [2022-02-20 14:21:40,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a44a614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:21:40, skipping insertion in model container [2022-02-20 14:21:40,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:21:40" (3/3) ... [2022-02-20 14:21:40,115 INFO L111 eAbstractionObserver]: Analyzing ICFG init-non-constant-2-n-u.c [2022-02-20 14:21:40,120 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:21:40,121 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:21:40,163 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:21:40,169 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:21:40,170 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:21:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:21:40,202 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:40,203 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:40,204 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1178325179, now seen corresponding path program 1 times [2022-02-20 14:21:40,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:40,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978848852] [2022-02-20 14:21:40,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:40,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:40,354 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:40,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858234825] [2022-02-20 14:21:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:40,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:40,363 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-02-20 14:21:40,371 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-02-20 14:21:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:40,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:21:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:40,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:40,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-02-20 14:21:40,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {26#true} is VALID [2022-02-20 14:21:40,600 INFO L272 TraceCheckUtils]: 2: Hoare triple {26#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {26#true} is VALID [2022-02-20 14:21:40,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#true} ~cond := #in~cond; {26#true} is VALID [2022-02-20 14:21:40,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#true} assume 0 == ~cond;assume false; {27#false} is VALID [2022-02-20 14:21:40,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} assume true; {27#false} is VALID [2022-02-20 14:21:40,602 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27#false} {26#true} #80#return; {27#false} is VALID [2022-02-20 14:21:40,602 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {27#false} is VALID [2022-02-20 14:21:40,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-02-20 14:21:40,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond;assume false; {27#false} is VALID [2022-02-20 14:21:40,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume true; {27#false} is VALID [2022-02-20 14:21:40,604 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {27#false} {27#false} #82#return; {27#false} is VALID [2022-02-20 14:21:40,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !(main_~i~0#1 < main_~q~0#1); {27#false} is VALID [2022-02-20 14:21:40,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {27#false} is VALID [2022-02-20 14:21:40,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {27#false} is VALID [2022-02-20 14:21:40,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {27#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {27#false} is VALID [2022-02-20 14:21:40,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:21:40,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:21:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:21:40,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:21:40,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:40,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978848852] [2022-02-20 14:21:40,609 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:40,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858234825] [2022-02-20 14:21:40,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858234825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:21:40,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:21:40,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:21:40,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226686319] [2022-02-20 14:21:40,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:21:40,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:21:40,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:40,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:40,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:21:40,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:21:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:21:40,692 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:40,760 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2022-02-20 14:21:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:21:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:21:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:21:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:21:40,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 14:21:40,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:40,867 INFO L225 Difference]: With dead ends: 43 [2022-02-20 14:21:40,867 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:21:40,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-02-20 14:21:40,874 INFO L933 BasicCegarLoop]: 27 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, 27 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-02-20 14:21:40,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:21:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:21:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:21:40,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:40,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,900 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,901 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:40,904 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:21:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:21:40,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:40,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:40,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 14:21:40,906 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 14:21:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:40,909 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:21:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:21:40,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:40,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:40,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:40,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 14:21:40,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 18 [2022-02-20 14:21:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:40,914 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 14:21:40,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:21:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:21:40,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:40,919 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:40,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:21:41,122 WARN L452 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-02-20 14:21:41,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1509384059, now seen corresponding path program 1 times [2022-02-20 14:21:41,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:41,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237915243] [2022-02-20 14:21:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:41,164 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:41,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011242052] [2022-02-20 14:21:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:41,168 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-02-20 14:21:41,187 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-02-20 14:21:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:41,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:21:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:41,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:41,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-02-20 14:21:41,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:21:41,387 INFO L272 TraceCheckUtils]: 2: Hoare triple {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {206#true} is VALID [2022-02-20 14:21:41,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 14:21:41,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 14:21:41,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 14:21:41,389 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {206#true} {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} #80#return; {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:21:41,389 INFO L272 TraceCheckUtils]: 7: Hoare triple {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {206#true} is VALID [2022-02-20 14:21:41,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 14:21:41,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 14:21:41,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 14:21:41,391 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {206#true} {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} #82#return; {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:21:41,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {214#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < main_~q~0#1); {248#(<= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 14:21:41,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#(<= |ULTIMATE.start_main_~q~0#1| 0)} main_~i~0#1 := 0;main_~j~0#1 := 0; {252#(and (<= |ULTIMATE.start_main_~q~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:21:41,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {252#(and (<= |ULTIMATE.start_main_~q~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {207#false} is VALID [2022-02-20 14:21:41,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {207#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {207#false} is VALID [2022-02-20 14:21:41,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {207#false} assume 0 == __VERIFIER_assert_~cond#1; {207#false} is VALID [2022-02-20 14:21:41,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-02-20 14:21:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:21:41,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:21:41,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:41,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237915243] [2022-02-20 14:21:41,394 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:41,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011242052] [2022-02-20 14:21:41,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011242052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:21:41,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:21:41,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:21:41,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796534074] [2022-02-20 14:21:41,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:21:41,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 14:21:41,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:41,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:41,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:41,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:21:41,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:21:41,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:21:41,415 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:41,514 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 14:21:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:21:41,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 14:21:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 14:21:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 14:21:41,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 14:21:41,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:41,564 INFO L225 Difference]: With dead ends: 38 [2022-02-20 14:21:41,565 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 14:21:41,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:21:41,566 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:41,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:21:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 14:21:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-02-20 14:21:41,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:41,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:41,574 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:41,574 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:41,576 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 14:21:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 14:21:41,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:41,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:41,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-02-20 14:21:41,577 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-02-20 14:21:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:41,580 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 14:21:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 14:21:41,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:41,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:41,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:41,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-20 14:21:41,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 18 [2022-02-20 14:21:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:41,583 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-20 14:21:41,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 14:21:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:21:41,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:41,584 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:41,612 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-02-20 14:21:41,807 WARN L452 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-02-20 14:21:41,808 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1347743446, now seen corresponding path program 1 times [2022-02-20 14:21:41,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:41,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267551512] [2022-02-20 14:21:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:41,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:41,823 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:41,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658394855] [2022-02-20 14:21:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:41,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:41,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:41,826 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-02-20 14:21:41,845 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-02-20 14:21:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:41,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:21:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:41,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:42,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {410#true} is VALID [2022-02-20 14:21:42,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {410#true} is VALID [2022-02-20 14:21:42,020 INFO L272 TraceCheckUtils]: 2: Hoare triple {410#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {410#true} is VALID [2022-02-20 14:21:42,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {410#true} ~cond := #in~cond; {410#true} is VALID [2022-02-20 14:21:42,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#true} assume !(0 == ~cond); {410#true} is VALID [2022-02-20 14:21:42,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 14:21:42,020 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {410#true} {410#true} #80#return; {410#true} is VALID [2022-02-20 14:21:42,021 INFO L272 TraceCheckUtils]: 7: Hoare triple {410#true} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {410#true} is VALID [2022-02-20 14:21:42,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {410#true} ~cond := #in~cond; {410#true} is VALID [2022-02-20 14:21:42,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {410#true} assume !(0 == ~cond); {410#true} is VALID [2022-02-20 14:21:42,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 14:21:42,022 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {410#true} {410#true} #82#return; {410#true} is VALID [2022-02-20 14:21:42,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#true} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {451#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:21:42,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 < main_~s~0#1); {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:42,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} main_~i~0#1 := 1 + main_~i~0#1; {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:42,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} assume !(main_~i~0#1 < main_~q~0#1); {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:42,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} main_~i~0#1 := 0;main_~j~0#1 := 0; {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:42,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {455#(<= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {468#(and (<= |ULTIMATE.start_main_~s~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:21:42,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {468#(and (<= |ULTIMATE.start_main_~s~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {411#false} is VALID [2022-02-20 14:21:42,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#false} assume 0 == __VERIFIER_assert_~cond#1; {411#false} is VALID [2022-02-20 14:21:42,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {411#false} assume !false; {411#false} is VALID [2022-02-20 14:21:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:21:42,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:21:42,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:42,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267551512] [2022-02-20 14:21:42,032 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:42,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658394855] [2022-02-20 14:21:42,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658394855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:21:42,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:21:42,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:21:42,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744519665] [2022-02-20 14:21:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:21:42,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 14:21:42,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:42,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:42,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:42,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:21:42,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:42,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:21:42,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:21:42,056 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:42,234 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-02-20 14:21:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:21:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 14:21:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 14:21:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 14:21:42,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 14:21:42,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:42,303 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:21:42,304 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:21:42,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:21:42,305 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:42,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:21:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:21:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-02-20 14:21:42,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:42,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:42,316 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:42,316 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:42,318 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:21:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:21:42,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:42,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:42,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 14:21:42,319 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 14:21:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:42,321 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 14:21:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:21:42,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:42,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:42,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:42,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 14:21:42,324 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 21 [2022-02-20 14:21:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:42,324 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 14:21:42,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:21:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:21:42,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:42,326 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:42,355 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-02-20 14:21:42,547 WARN L452 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-02-20 14:21:42,548 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -142126156, now seen corresponding path program 1 times [2022-02-20 14:21:42,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:42,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030133969] [2022-02-20 14:21:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:42,562 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:42,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010249155] [2022-02-20 14:21:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:42,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:42,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:42,564 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-02-20 14:21:42,569 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-02-20 14:21:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:42,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 14:21:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:42,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:42,722 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-02-20 14:21:42,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {642#true} is VALID [2022-02-20 14:21:42,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:21:42,849 INFO L272 TraceCheckUtils]: 2: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {642#true} is VALID [2022-02-20 14:21:42,850 INFO L290 TraceCheckUtils]: 3: Hoare triple {642#true} ~cond := #in~cond; {642#true} is VALID [2022-02-20 14:21:42,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {642#true} assume !(0 == ~cond); {642#true} is VALID [2022-02-20 14:21:42,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#true} assume true; {642#true} is VALID [2022-02-20 14:21:42,854 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {642#true} {650#(= |ULTIMATE.start_main_~i~0#1| 0)} #80#return; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:21:42,854 INFO L272 TraceCheckUtils]: 7: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {642#true} is VALID [2022-02-20 14:21:42,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#true} ~cond := #in~cond; {642#true} is VALID [2022-02-20 14:21:42,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#true} assume !(0 == ~cond); {642#true} is VALID [2022-02-20 14:21:42,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#true} assume true; {642#true} is VALID [2022-02-20 14:21:42,855 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {642#true} {650#(= |ULTIMATE.start_main_~i~0#1| 0)} #82#return; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:21:42,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {684#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:42,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} is VALID [2022-02-20 14:21:42,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} assume !(main_~j~0#1 < main_~s~0#1); {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} is VALID [2022-02-20 14:21:42,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} is VALID [2022-02-20 14:21:42,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} assume !(main_~i~0#1 < main_~q~0#1); {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} is VALID [2022-02-20 14:21:42,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {688#(= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {701#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:21:42,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {705#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:42,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {705#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {709#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:21:42,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {643#false} is VALID [2022-02-20 14:21:42,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {643#false} assume !false; {643#false} is VALID [2022-02-20 14:21:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:21:42,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:45,328 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-02-20 14:21:45,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2022-02-20 14:22:11,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {643#false} assume !false; {643#false} is VALID [2022-02-20 14:22:11,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {643#false} is VALID [2022-02-20 14:22:11,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {722#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (* |ULTIMATE.start_main_~j~0#1| 4))) 4294967296))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {709#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:11,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)))) 4294967296))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {722#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (* |ULTIMATE.start_main_~j~0#1| 4))) 4294967296))} is VALID [2022-02-20 14:22:11,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} main_~i~0#1 := 0;main_~j~0#1 := 0; {726#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)))) 4294967296))} is VALID [2022-02-20 14:22:11,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} assume !(main_~i~0#1 < main_~q~0#1); {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:11,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} main_~i~0#1 := 1 + main_~i~0#1; {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:11,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} assume !(main_~j~0#1 < main_~s~0#1); {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:11,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {730#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:11,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {684#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:22:11,727 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {642#true} {650#(= |ULTIMATE.start_main_~i~0#1| 0)} #82#return; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:11,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#true} assume true; {642#true} is VALID [2022-02-20 14:22:11,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#true} assume !(0 == ~cond); {642#true} is VALID [2022-02-20 14:22:11,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#true} ~cond := #in~cond; {642#true} is VALID [2022-02-20 14:22:11,728 INFO L272 TraceCheckUtils]: 7: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {642#true} is VALID [2022-02-20 14:22:11,729 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {642#true} {650#(= |ULTIMATE.start_main_~i~0#1| 0)} #80#return; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:11,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#true} assume true; {642#true} is VALID [2022-02-20 14:22:11,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {642#true} assume !(0 == ~cond); {642#true} is VALID [2022-02-20 14:22:11,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {642#true} ~cond := #in~cond; {642#true} is VALID [2022-02-20 14:22:11,730 INFO L272 TraceCheckUtils]: 2: Hoare triple {650#(= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {642#true} is VALID [2022-02-20 14:22:11,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {642#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {650#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:11,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {642#true} is VALID [2022-02-20 14:22:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:11,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:11,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030133969] [2022-02-20 14:22:11,731 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:11,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010249155] [2022-02-20 14:22:11,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010249155] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:11,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:11,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-02-20 14:22:11,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411366542] [2022-02-20 14:22:11,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 14:22:11,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:11,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:11,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:11,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:22:11,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:11,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:22:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:22:11,764 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:12,360 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-02-20 14:22:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:22:12,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 14:22:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-02-20 14:22:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-02-20 14:22:12,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2022-02-20 14:22:12,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:12,430 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:22:12,430 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 14:22:12,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:22:12,432 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:12,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 113 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:22:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 14:22:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 30. [2022-02-20 14:22:12,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:12,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:12,443 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:12,444 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:12,446 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-02-20 14:22:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-02-20 14:22:12,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:12,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:12,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 62 states. [2022-02-20 14:22:12,448 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 62 states. [2022-02-20 14:22:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:12,463 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-02-20 14:22:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-02-20 14:22:12,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:12,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:12,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:12,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 14:22:12,470 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 22 [2022-02-20 14:22:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:12,471 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 14:22:12,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 14:22:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:22:12,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:12,474 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:12,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 14:22:12,695 WARN L452 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-02-20 14:22:12,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash 762284573, now seen corresponding path program 1 times [2022-02-20 14:22:12,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:12,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313889496] [2022-02-20 14:22:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:12,713 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:12,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688197856] [2022-02-20 14:22:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:12,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:12,715 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-02-20 14:22:12,734 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-02-20 14:22:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:12,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:22:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:12,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:12,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {1053#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-02-20 14:22:12,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1053#true} is VALID [2022-02-20 14:22:12,964 INFO L272 TraceCheckUtils]: 2: Hoare triple {1053#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1053#true} is VALID [2022-02-20 14:22:12,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {1053#true} ~cond := #in~cond; {1053#true} is VALID [2022-02-20 14:22:12,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {1053#true} assume !(0 == ~cond); {1053#true} is VALID [2022-02-20 14:22:12,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-02-20 14:22:12,964 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1053#true} {1053#true} #80#return; {1053#true} is VALID [2022-02-20 14:22:12,965 INFO L272 TraceCheckUtils]: 7: Hoare triple {1053#true} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1053#true} is VALID [2022-02-20 14:22:12,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {1053#true} ~cond := #in~cond; {1053#true} is VALID [2022-02-20 14:22:12,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {1053#true} assume !(0 == ~cond); {1053#true} is VALID [2022-02-20 14:22:12,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-02-20 14:22:12,965 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1053#true} {1053#true} #82#return; {1053#true} is VALID [2022-02-20 14:22:12,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {1053#true} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1094#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:22:12,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {1094#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {1098#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:22:12,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < main_~s~0#1); {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:12,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} main_~i~0#1 := 1 + main_~i~0#1; {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:12,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} assume !(main_~i~0#1 < main_~q~0#1); {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:12,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} main_~i~0#1 := 0;main_~j~0#1 := 0; {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:12,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1115#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 14:22:12,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {1115#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1115#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 14:22:12,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {1115#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {1115#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 14:22:12,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {1115#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;main_~j~0#1 := 1 + main_~j~0#1; {1125#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 14:22:12,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {1125#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1054#false} is VALID [2022-02-20 14:22:12,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {1054#false} assume 0 == __VERIFIER_assert_~cond#1; {1054#false} is VALID [2022-02-20 14:22:12,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-02-20 14:22:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:12,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:13,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-02-20 14:22:13,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {1054#false} assume 0 == __VERIFIER_assert_~cond#1; {1054#false} is VALID [2022-02-20 14:22:13,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {1141#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1054#false} is VALID [2022-02-20 14:22:13,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {1145#(<= |ULTIMATE.start_main_~s~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;main_~j~0#1 := 1 + main_~j~0#1; {1141#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 14:22:13,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {1145#(<= |ULTIMATE.start_main_~s~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {1145#(<= |ULTIMATE.start_main_~s~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 14:22:13,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {1145#(<= |ULTIMATE.start_main_~s~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1145#(<= |ULTIMATE.start_main_~s~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 14:22:13,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1145#(<= |ULTIMATE.start_main_~s~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 14:22:13,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} main_~i~0#1 := 0;main_~j~0#1 := 0; {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:13,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} assume !(main_~i~0#1 < main_~q~0#1); {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:13,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} main_~i~0#1 := 1 + main_~i~0#1; {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:13,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < main_~s~0#1); {1102#(<= |ULTIMATE.start_main_~s~0#1| 1)} is VALID [2022-02-20 14:22:13,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {1094#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {1098#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:22:13,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1053#true} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1094#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:22:13,121 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1053#true} {1053#true} #82#return; {1053#true} is VALID [2022-02-20 14:22:13,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-02-20 14:22:13,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1053#true} assume !(0 == ~cond); {1053#true} is VALID [2022-02-20 14:22:13,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {1053#true} ~cond := #in~cond; {1053#true} is VALID [2022-02-20 14:22:13,122 INFO L272 TraceCheckUtils]: 7: Hoare triple {1053#true} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1053#true} is VALID [2022-02-20 14:22:13,123 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1053#true} {1053#true} #80#return; {1053#true} is VALID [2022-02-20 14:22:13,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-02-20 14:22:13,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {1053#true} assume !(0 == ~cond); {1053#true} is VALID [2022-02-20 14:22:13,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {1053#true} ~cond := #in~cond; {1053#true} is VALID [2022-02-20 14:22:13,123 INFO L272 TraceCheckUtils]: 2: Hoare triple {1053#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1053#true} is VALID [2022-02-20 14:22:13,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1053#true} is VALID [2022-02-20 14:22:13,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {1053#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-02-20 14:22:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:13,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:13,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313889496] [2022-02-20 14:22:13,124 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:13,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688197856] [2022-02-20 14:22:13,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688197856] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:13,125 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:13,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:22:13,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108506916] [2022-02-20 14:22:13,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 14:22:13,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:13,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:13,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:13,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:22:13,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:13,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:22:13,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:22:13,150 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:13,461 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2022-02-20 14:22:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:22:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 14:22:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-02-20 14:22:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-02-20 14:22:13,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-02-20 14:22:13,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:13,530 INFO L225 Difference]: With dead ends: 80 [2022-02-20 14:22:13,531 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 14:22:13,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:22:13,532 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:13,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 111 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:22:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 14:22:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2022-02-20 14:22:13,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:13,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:13,593 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:13,593 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:13,595 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-02-20 14:22:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-02-20 14:22:13,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:13,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:13,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-02-20 14:22:13,597 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-02-20 14:22:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:13,599 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-02-20 14:22:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-02-20 14:22:13,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:13,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:13,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:13,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-02-20 14:22:13,602 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 25 [2022-02-20 14:22:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:13,603 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-02-20 14:22:13,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-02-20 14:22:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:22:13,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:13,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:13,624 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-02-20 14:22:13,815 WARN L452 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-02-20 14:22:13,816 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 923457379, now seen corresponding path program 2 times [2022-02-20 14:22:13,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:13,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975777426] [2022-02-20 14:22:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:13,837 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:13,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964511730] [2022-02-20 14:22:13,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:22:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:13,839 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-02-20 14:22:13,864 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-02-20 14:22:13,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:22:13,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:22:13,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 14:22:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:13,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:14,034 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 19 treesize of output 15 [2022-02-20 14:22:14,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:14,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-20 14:22:14,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {1552#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1552#true} is VALID [2022-02-20 14:22:14,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1552#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,337 INFO L272 TraceCheckUtils]: 2: Hoare triple {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1552#true} is VALID [2022-02-20 14:22:14,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {1552#true} ~cond := #in~cond; {1552#true} is VALID [2022-02-20 14:22:14,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {1552#true} assume !(0 == ~cond); {1552#true} is VALID [2022-02-20 14:22:14,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-02-20 14:22:14,338 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1552#true} {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} #80#return; {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,338 INFO L272 TraceCheckUtils]: 7: Hoare triple {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1552#true} is VALID [2022-02-20 14:22:14,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {1552#true} ~cond := #in~cond; {1552#true} is VALID [2022-02-20 14:22:14,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#true} assume !(0 == ~cond); {1552#true} is VALID [2022-02-20 14:22:14,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-02-20 14:22:14,340 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1552#true} {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} #82#return; {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1594#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {1594#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {1598#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {1598#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~j~0#1 < main_~s~0#1); {1598#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1598#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 1 + main_~i~0#1; {1605#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1609#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {1609#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~j~0#1 < main_~s~0#1); {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 1 + main_~i~0#1; {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~i~0#1 < main_~q~0#1); {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {1613#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 0;main_~j~0#1 := 0; {1598#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1629#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:14,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {1629#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#A~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1633#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:14,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {1633#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1553#false} is VALID [2022-02-20 14:22:14,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2022-02-20 14:22:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:14,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:17,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_23| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_23|)) (forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_23| (* |c_ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |c_ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |c_ULTIMATE.start_main_~C~0#1| 4294967296))))) is different from false [2022-02-20 14:22:21,564 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 36 treesize of output 34 [2022-02-20 14:22:21,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 95 [2022-02-20 14:22:26,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2022-02-20 14:22:26,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {1633#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1553#false} is VALID [2022-02-20 14:22:26,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {1646#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (* |ULTIMATE.start_main_~j~0#1| 4))) 4294967296))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1633#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:26,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {1650#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)))) 4294967296))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1646#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (* |ULTIMATE.start_main_~j~0#1| 4))) 4294967296))} is VALID [2022-02-20 14:22:26,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} main_~i~0#1 := 0;main_~j~0#1 := 0; {1650#(= (mod (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)))) 4294967296))} is VALID [2022-02-20 14:22:26,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} assume !(main_~i~0#1 < main_~q~0#1); {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:26,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} main_~i~0#1 := 1 + main_~i~0#1; {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:26,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} assume !(main_~j~0#1 < main_~s~0#1); {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:26,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {1667#(forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (* |ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {1654#(= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296))} is VALID [2022-02-20 14:22:26,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {1671#(forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1667#(forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (* |ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))} is VALID [2022-02-20 14:22:26,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {1675#(forall ((|v_ULTIMATE.start_main_~i~0#1_23| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_23|)) (forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_23| (* |ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))))} main_~i~0#1 := 1 + main_~i~0#1; {1671#(forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))} is VALID [2022-02-20 14:22:26,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {1675#(forall ((|v_ULTIMATE.start_main_~i~0#1_23| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_23|)) (forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_23| (* |ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))))} assume !(main_~j~0#1 < main_~s~0#1); {1675#(forall ((|v_ULTIMATE.start_main_~i~0#1_23| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_23|)) (forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_23| (* |ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))))} is VALID [2022-02-20 14:22:26,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (< (div 0 |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~i~0#1| 1)) (= (+ (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) (* |ULTIMATE.start_main_~j~0#1| 4)) 0) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1) (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (- 4294967296))))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {1675#(forall ((|v_ULTIMATE.start_main_~i~0#1_23| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_23|)) (forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_23| (* |ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |ULTIMATE.start_main_~C~0#1| 4294967296)))))} is VALID [2022-02-20 14:22:26,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1682#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (< (div 0 |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~i~0#1| 1)) (= (+ (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) (* |ULTIMATE.start_main_~j~0#1| 4)) 0) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1) (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (- 4294967296))))} is VALID [2022-02-20 14:22:26,871 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1552#true} {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} #82#return; {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} is VALID [2022-02-20 14:22:26,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-02-20 14:22:26,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#true} assume !(0 == ~cond); {1552#true} is VALID [2022-02-20 14:22:26,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1552#true} ~cond := #in~cond; {1552#true} is VALID [2022-02-20 14:22:26,871 INFO L272 TraceCheckUtils]: 7: Hoare triple {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1552#true} is VALID [2022-02-20 14:22:26,876 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1552#true} {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} #80#return; {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} is VALID [2022-02-20 14:22:26,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {1552#true} assume true; {1552#true} is VALID [2022-02-20 14:22:26,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {1552#true} assume !(0 == ~cond); {1552#true} is VALID [2022-02-20 14:22:26,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {1552#true} ~cond := #in~cond; {1552#true} is VALID [2022-02-20 14:22:26,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1552#true} is VALID [2022-02-20 14:22:26,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1552#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1686#(and (not (= |ULTIMATE.start_main_~n~0#1| 0)) (= (* (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) 4) 0))} is VALID [2022-02-20 14:22:26,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {1552#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1552#true} is VALID [2022-02-20 14:22:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-02-20 14:22:26,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:26,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975777426] [2022-02-20 14:22:26,878 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:26,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964511730] [2022-02-20 14:22:26,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964511730] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:26,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:26,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2022-02-20 14:22:26,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516438542] [2022-02-20 14:22:26,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-02-20 14:22:26,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:26,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:22:26,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:26,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 14:22:26,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 14:22:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=212, Unknown=2, NotChecked=30, Total=306 [2022-02-20 14:22:26,950 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:22:29,463 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~n~0#1| 1500) (forall ((|v_ULTIMATE.start_main_~i~0#1_23| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_23|)) (forall ((v_ArrVal_46 Int)) (= (mod (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_23| (* |c_ULTIMATE.start_main_~n~0#1| 4))) v_ArrVal_46) |c_ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod |c_ULTIMATE.start_main_~C~0#1| 4294967296))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#A~0#1.offset| 0) (= (+ |c_ULTIMATE.start_main_~C~0#1| |c_ULTIMATE.start_main_~i~0#1|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-02-20 14:22:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:30,341 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-02-20 14:22:30,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:22:30,341 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-02-20 14:22:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:22:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-02-20 14:22:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:22:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-02-20 14:22:30,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-02-20 14:22:30,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:30,428 INFO L225 Difference]: With dead ends: 76 [2022-02-20 14:22:30,428 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 14:22:30,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=111, Invalid=356, Unknown=3, NotChecked=82, Total=552 [2022-02-20 14:22:30,429 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:30,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 135 Invalid, 0 Unknown, 70 Unchecked, 0.3s Time] [2022-02-20 14:22:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 14:22:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-02-20 14:22:30,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:30,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:30,486 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:30,486 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:30,490 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-02-20 14:22:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-02-20 14:22:30,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:30,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:30,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 74 states. [2022-02-20 14:22:30,492 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 74 states. [2022-02-20 14:22:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:30,498 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-02-20 14:22:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-02-20 14:22:30,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:30,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:30,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:30,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-02-20 14:22:30,504 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2022-02-20 14:22:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:30,504 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-02-20 14:22:30,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:22:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 14:22:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:22:30,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:30,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:30,534 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-02-20 14:22:30,733 WARN L452 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-02-20 14:22:30,734 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash -789350489, now seen corresponding path program 2 times [2022-02-20 14:22:30,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:30,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291154713] [2022-02-20 14:22:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:30,749 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:30,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623564540] [2022-02-20 14:22:30,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:22:30,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:30,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:30,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:22:30,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:22:30,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:22:30,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:22:30,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 14:22:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:30,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:30,937 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 15 treesize of output 11 [2022-02-20 14:22:31,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2092#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2092#true} is VALID [2022-02-20 14:22:31,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {2092#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,127 INFO L272 TraceCheckUtils]: 2: Hoare triple {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {2092#true} is VALID [2022-02-20 14:22:31,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-02-20 14:22:31,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-02-20 14:22:31,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-02-20 14:22:31,128 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2092#true} {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} #80#return; {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,128 INFO L272 TraceCheckUtils]: 7: Hoare triple {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {2092#true} is VALID [2022-02-20 14:22:31,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {2092#true} ~cond := #in~cond; {2092#true} is VALID [2022-02-20 14:22:31,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {2092#true} assume !(0 == ~cond); {2092#true} is VALID [2022-02-20 14:22:31,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {2092#true} assume true; {2092#true} is VALID [2022-02-20 14:22:31,129 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2092#true} {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} #82#return; {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {2100#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2134#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2138#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {2138#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~j~0#1 < main_~s~0#1); {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 1 + main_~i~0#1; {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~i~0#1 < main_~q~0#1); {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2142#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 0;main_~j~0#1 := 0; {2155#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2159#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {2159#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2159#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {2159#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(0 == __VERIFIER_assert_~cond#1); {2159#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {2159#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;main_~j~0#1 := 1 + main_~j~0#1; {2169#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:31,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {2169#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| 4)) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2173#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:31,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {2173#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2093#false} is VALID [2022-02-20 14:22:31,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {2093#false} assume !false; {2093#false} is VALID [2022-02-20 14:22:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:31,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:35,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-02-20 14:22:36,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-02-20 14:22:38,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:38,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291154713] [2022-02-20 14:22:38,056 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:38,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623564540] [2022-02-20 14:22:38,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623564540] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:22:38,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:22:38,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 14:22:38,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646835234] [2022-02-20 14:22:38,056 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:38,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 14:22:38,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:38,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:38,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:38,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 14:22:38,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:38,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 14:22:38,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:22:38,080 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:38,593 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-02-20 14:22:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:22:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 14:22:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-02-20 14:22:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-02-20 14:22:38,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2022-02-20 14:22:38,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:38,690 INFO L225 Difference]: With dead ends: 91 [2022-02-20 14:22:38,690 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 14:22:38,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:22:38,691 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:38,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 94 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:22:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 14:22:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2022-02-20 14:22:38,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:38,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 59 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:38,746 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 59 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:38,746 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 59 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:38,750 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2022-02-20 14:22:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-02-20 14:22:38,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:38,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:38,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 89 states. [2022-02-20 14:22:38,752 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 89 states. [2022-02-20 14:22:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:38,755 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2022-02-20 14:22:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-02-20 14:22:38,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:38,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:38,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:38,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-02-20 14:22:38,758 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2022-02-20 14:22:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:38,758 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-02-20 14:22:38,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 14:22:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:22:38,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:38,761 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:38,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:38,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:38,984 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 67410713, now seen corresponding path program 3 times [2022-02-20 14:22:38,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:38,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181024039] [2022-02-20 14:22:38,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:38,996 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:38,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012776140] [2022-02-20 14:22:38,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:22:38,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:38,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:38,998 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:22:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 14:22:39,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:22:39,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:22:39,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:22:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:39,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:39,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {2652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {2652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L272 TraceCheckUtils]: 2: Hoare triple {2652#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {2652#true} ~cond := #in~cond; {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {2652#true} assume !(0 == ~cond); {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {2652#true} assume true; {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2652#true} {2652#true} #80#return; {2652#true} is VALID [2022-02-20 14:22:39,187 INFO L272 TraceCheckUtils]: 7: Hoare triple {2652#true} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {2652#true} is VALID [2022-02-20 14:22:39,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {2652#true} ~cond := #in~cond; {2652#true} is VALID [2022-02-20 14:22:39,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {2652#true} assume !(0 == ~cond); {2652#true} is VALID [2022-02-20 14:22:39,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {2652#true} assume true; {2652#true} is VALID [2022-02-20 14:22:39,188 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2652#true} {2652#true} #82#return; {2652#true} is VALID [2022-02-20 14:22:39,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2652#true} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2693#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 14:22:39,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2697#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 14:22:39,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {2697#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} assume !(main_~j~0#1 < main_~s~0#1); {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2711#(and (< 1 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:22:39,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {2711#(and (< 1 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2715#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (< 1 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 14:22:39,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {2715#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (< 1 |ULTIMATE.start_main_~s~0#1|))} assume !(main_~j~0#1 < main_~s~0#1); {2653#false} is VALID [2022-02-20 14:22:39,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {2653#false} main_~i~0#1 := 1 + main_~i~0#1; {2653#false} is VALID [2022-02-20 14:22:39,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {2653#false} assume !(main_~i~0#1 < main_~q~0#1); {2653#false} is VALID [2022-02-20 14:22:39,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {2653#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {2653#false} is VALID [2022-02-20 14:22:39,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {2653#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2653#false} is VALID [2022-02-20 14:22:39,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {2653#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2653#false} is VALID [2022-02-20 14:22:39,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {2653#false} assume 0 == __VERIFIER_assert_~cond#1; {2653#false} is VALID [2022-02-20 14:22:39,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {2653#false} assume !false; {2653#false} is VALID [2022-02-20 14:22:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:39,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:39,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {2653#false} assume !false; {2653#false} is VALID [2022-02-20 14:22:39,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {2653#false} assume 0 == __VERIFIER_assert_~cond#1; {2653#false} is VALID [2022-02-20 14:22:39,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {2653#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2653#false} is VALID [2022-02-20 14:22:39,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {2653#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2653#false} is VALID [2022-02-20 14:22:39,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {2653#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {2653#false} is VALID [2022-02-20 14:22:39,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {2653#false} assume !(main_~i~0#1 < main_~q~0#1); {2653#false} is VALID [2022-02-20 14:22:39,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {2653#false} main_~i~0#1 := 1 + main_~i~0#1; {2653#false} is VALID [2022-02-20 14:22:39,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~s~0#1|)} assume !(main_~j~0#1 < main_~s~0#1); {2653#false} is VALID [2022-02-20 14:22:39,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {2765#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~s~0#1|)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2761#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2765#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} assume !(main_~j~0#1 < main_~s~0#1); {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2697#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2701#(< 1 |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 14:22:39,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {2697#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 14:22:39,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2652#true} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2693#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 14:22:39,308 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2652#true} {2652#true} #82#return; {2652#true} is VALID [2022-02-20 14:22:39,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {2652#true} assume true; {2652#true} is VALID [2022-02-20 14:22:39,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {2652#true} assume !(0 == ~cond); {2652#true} is VALID [2022-02-20 14:22:39,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {2652#true} ~cond := #in~cond; {2652#true} is VALID [2022-02-20 14:22:39,309 INFO L272 TraceCheckUtils]: 7: Hoare triple {2652#true} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {2652#true} is VALID [2022-02-20 14:22:39,309 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2652#true} {2652#true} #80#return; {2652#true} is VALID [2022-02-20 14:22:39,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {2652#true} assume true; {2652#true} is VALID [2022-02-20 14:22:39,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {2652#true} assume !(0 == ~cond); {2652#true} is VALID [2022-02-20 14:22:39,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {2652#true} ~cond := #in~cond; {2652#true} is VALID [2022-02-20 14:22:39,310 INFO L272 TraceCheckUtils]: 2: Hoare triple {2652#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {2652#true} is VALID [2022-02-20 14:22:39,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {2652#true} is VALID [2022-02-20 14:22:39,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {2652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {2652#true} is VALID [2022-02-20 14:22:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:39,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:39,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181024039] [2022-02-20 14:22:39,311 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:39,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012776140] [2022-02-20 14:22:39,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012776140] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:39,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:39,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:22:39,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020886241] [2022-02-20 14:22:39,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 14:22:39,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:39,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:39,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:39,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:22:39,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:22:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:22:39,335 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:39,661 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-02-20 14:22:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:22:39,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 14:22:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-02-20 14:22:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-02-20 14:22:39,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-02-20 14:22:39,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:39,728 INFO L225 Difference]: With dead ends: 82 [2022-02-20 14:22:39,729 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 14:22:39,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:22:39,729 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:39,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:22:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 14:22:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-02-20 14:22:39,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:39,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:39,803 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:39,804 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:39,806 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-02-20 14:22:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-02-20 14:22:39,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:39,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:39,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-02-20 14:22:39,806 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-02-20 14:22:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:39,808 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-02-20 14:22:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-02-20 14:22:39,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:39,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:39,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:39,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-02-20 14:22:39,810 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 27 [2022-02-20 14:22:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:39,811 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-02-20 14:22:39,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-02-20 14:22:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:39,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:39,814 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:39,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:40,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-20 14:22:40,020 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1681074929, now seen corresponding path program 1 times [2022-02-20 14:22:40,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:40,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373202265] [2022-02-20 14:22:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:40,031 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:40,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565731854] [2022-02-20 14:22:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:40,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:40,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:40,033 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:22:40,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 14:22:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:40,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:22:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:40,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:40,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3188#true} is VALID [2022-02-20 14:22:40,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,291 INFO L272 TraceCheckUtils]: 2: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {3188#true} is VALID [2022-02-20 14:22:40,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {3188#true} ~cond := #in~cond; {3188#true} is VALID [2022-02-20 14:22:40,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {3188#true} assume !(0 == ~cond); {3188#true} is VALID [2022-02-20 14:22:40,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {3188#true} assume true; {3188#true} is VALID [2022-02-20 14:22:40,292 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3188#true} {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} #80#return; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,292 INFO L272 TraceCheckUtils]: 7: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {3188#true} is VALID [2022-02-20 14:22:40,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {3188#true} ~cond := #in~cond; {3188#true} is VALID [2022-02-20 14:22:40,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {3188#true} assume !(0 == ~cond); {3188#true} is VALID [2022-02-20 14:22:40,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {3188#true} assume true; {3188#true} is VALID [2022-02-20 14:22:40,294 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3188#true} {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} #82#return; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~s~0#1); {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 1 + main_~i~0#1; {3239#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:22:40,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {3239#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~q~0#1); {3243#(<= |ULTIMATE.start_main_~q~0#1| 1)} is VALID [2022-02-20 14:22:40,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {3243#(<= |ULTIMATE.start_main_~q~0#1| 1)} main_~i~0#1 := 0;main_~j~0#1 := 0; {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;main_~j~0#1 := 1 + main_~j~0#1; {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~j~0#1 < main_~s~0#1); {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {3247#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := 1 + main_~i~0#1; {3266#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:22:40,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {3266#(and (<= |ULTIMATE.start_main_~q~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3189#false} is VALID [2022-02-20 14:22:40,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {3189#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3189#false} is VALID [2022-02-20 14:22:40,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {3189#false} assume 0 == __VERIFIER_assert_~cond#1; {3189#false} is VALID [2022-02-20 14:22:40,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {3189#false} assume !false; {3189#false} is VALID [2022-02-20 14:22:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:22:40,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:40,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {3189#false} assume !false; {3189#false} is VALID [2022-02-20 14:22:40,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {3189#false} assume 0 == __VERIFIER_assert_~cond#1; {3189#false} is VALID [2022-02-20 14:22:40,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {3189#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3189#false} is VALID [2022-02-20 14:22:40,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {3288#(not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~q~0#1|))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3189#false} is VALID [2022-02-20 14:22:40,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_~i~0#1 := 1 + main_~i~0#1; {3288#(not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~q~0#1|))} is VALID [2022-02-20 14:22:40,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~j~0#1 < main_~s~0#1); {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:22:40,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;main_~j~0#1 := 1 + main_~j~0#1; {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:22:40,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:22:40,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:22:40,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:22:40,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {3243#(<= |ULTIMATE.start_main_~q~0#1| 1)} main_~i~0#1 := 0;main_~j~0#1 := 0; {3292#(<= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:22:40,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {3239#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~q~0#1); {3243#(<= |ULTIMATE.start_main_~q~0#1| 1)} is VALID [2022-02-20 14:22:40,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 1 + main_~i~0#1; {3239#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:22:40,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~s~0#1); {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,481 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3188#true} {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} #82#return; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {3188#true} assume true; {3188#true} is VALID [2022-02-20 14:22:40,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {3188#true} assume !(0 == ~cond); {3188#true} is VALID [2022-02-20 14:22:40,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {3188#true} ~cond := #in~cond; {3188#true} is VALID [2022-02-20 14:22:40,482 INFO L272 TraceCheckUtils]: 7: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {3188#true} is VALID [2022-02-20 14:22:40,483 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3188#true} {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} #80#return; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {3188#true} assume true; {3188#true} is VALID [2022-02-20 14:22:40,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {3188#true} assume !(0 == ~cond); {3188#true} is VALID [2022-02-20 14:22:40,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {3188#true} ~cond := #in~cond; {3188#true} is VALID [2022-02-20 14:22:40,483 INFO L272 TraceCheckUtils]: 2: Hoare triple {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {3188#true} is VALID [2022-02-20 14:22:40,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {3196#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:22:40,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3188#true} is VALID [2022-02-20 14:22:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:22:40,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:40,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373202265] [2022-02-20 14:22:40,485 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:40,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565731854] [2022-02-20 14:22:40,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565731854] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:40,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:40,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:22:40,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611588091] [2022-02-20 14:22:40,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 14:22:40,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:40,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:40,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:40,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:22:40,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:22:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:22:40,523 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:40,875 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-02-20 14:22:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:22:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 14:22:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-02-20 14:22:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-02-20 14:22:40,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-02-20 14:22:40,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:40,941 INFO L225 Difference]: With dead ends: 129 [2022-02-20 14:22:40,941 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 14:22:40,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:22:40,942 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:40,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 74 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 14:22:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2022-02-20 14:22:41,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:41,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 62 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:41,032 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 62 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:41,033 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 62 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,036 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-02-20 14:22:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2022-02-20 14:22:41,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:41,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:41,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 14:22:41,037 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 14:22:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,039 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-02-20 14:22:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2022-02-20 14:22:41,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:41,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:41,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:41,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-02-20 14:22:41,041 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 28 [2022-02-20 14:22:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:41,041 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-02-20 14:22:41,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:22:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-02-20 14:22:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:41,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:41,042 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:41,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:41,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:41,256 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 777979813, now seen corresponding path program 4 times [2022-02-20 14:22:41,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:41,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163517847] [2022-02-20 14:22:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:41,276 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:41,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249971691] [2022-02-20 14:22:41,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:22:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:41,278 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:22:41,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 14:22:41,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:22:41,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:22:41,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 14:22:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:41,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:41,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 19 treesize of output 15 [2022-02-20 14:22:41,544 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-02-20 14:22:41,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-02-20 14:22:41,666 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-02-20 14:22:41,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-20 14:22:41,789 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-02-20 14:22:41,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-02-20 14:22:41,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {3875#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {3875#true} is VALID [2022-02-20 14:22:41,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {3875#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~C~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~m~0#1 := 1000;main_~n~0#1 := 1500;havoc main_~q~0#1;havoc main_~s~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);main_~C~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~q~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,982 INFO L272 TraceCheckUtils]: 2: Hoare triple {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {3875#true} is VALID [2022-02-20 14:22:41,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {3875#true} ~cond := #in~cond; {3875#true} is VALID [2022-02-20 14:22:41,982 INFO L290 TraceCheckUtils]: 4: Hoare triple {3875#true} assume !(0 == ~cond); {3875#true} is VALID [2022-02-20 14:22:41,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {3875#true} assume true; {3875#true} is VALID [2022-02-20 14:22:41,983 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3875#true} {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} #80#return; {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,983 INFO L272 TraceCheckUtils]: 7: Hoare triple {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {3875#true} is VALID [2022-02-20 14:22:41,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {3875#true} ~cond := #in~cond; {3875#true} is VALID [2022-02-20 14:22:41,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {3875#true} assume !(0 == ~cond); {3875#true} is VALID [2022-02-20 14:22:41,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {3875#true} assume true; {3875#true} is VALID [2022-02-20 14:22:41,984 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3875#true} {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} #82#return; {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3917#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {3917#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {3921#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {3925#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {3925#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~j~0#1 < main_~s~0#1); {3925#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {3925#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 1 + main_~i~0#1; {3932#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {3932#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3936#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {3936#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {3940#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {3940#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= (+ |ULTIMATE.start_main_~C~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~n~0#1| 4))))) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call write~int(main_~i~0#1 + main_~j~0#1 + main_~C~0#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);main_~j~0#1 := 1 + main_~j~0#1; {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~j~0#1 < main_~s~0#1); {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 1 + main_~i~0#1; {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !(main_~i~0#1 < main_~q~0#1); {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {3944#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} main_~i~0#1 := 0;main_~j~0#1 := 0; {3957#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {3957#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3961#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} is VALID [2022-02-20 14:22:41,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {3961#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) |ULTIMATE.start_main_~#A~0#1.offset|) |ULTIMATE.start_main_~C~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#A~0#1.base|) (+ |ULTIMATE.start_main_~#A~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))) (+ |ULTIMATE.start_main_~C~0#1| 1)) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 1500))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 % 4294967296 == (main_~i~0#1 + main_~j~0#1 + main_~C~0#1) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3965#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:41,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {3965#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3876#false} is VALID [2022-02-20 14:22:41,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {3876#false} assume !false; {3876#false} is VALID [2022-02-20 14:22:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:41,996 INFO L328 TraceCheckSpWp]: Computing backward predicates...