./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array12_pattern.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-patterns/array12_pattern.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 4cd544b9fc2c4c641198812054f6f7e3a4b46d14448acc5758393bf17818405b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:38,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:38,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:38,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:38,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:38,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:38,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:38,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:38,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:38,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:38,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:38,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:38,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:38,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:38,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:38,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:38,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:38,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:38,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:38,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:38,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:38,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:38,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:38,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:38,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:38,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:38,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:38,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:38,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:38,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:38,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:38,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:38,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:38,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:38,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:38,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:38,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:38,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:38,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:38,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:38,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:38,320 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:22:38,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:38,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:38,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:38,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:38,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:38,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:38,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:38,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:38,339 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:38,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:38,340 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:38,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:22:38,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:38,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:38,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:38,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:38,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:38,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:38,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:38,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:38,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:38,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:38,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:22:38,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:22:38,344 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:38,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:38,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:38,344 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 -> 4cd544b9fc2c4c641198812054f6f7e3a4b46d14448acc5758393bf17818405b [2022-02-20 14:22:38,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:38,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:38,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:38,556 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:38,557 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:38,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array12_pattern.c [2022-02-20 14:22:38,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb3be48d/ba88b97d8b3c4b02a0a068a848f31419/FLAGd9d8becfd [2022-02-20 14:22:38,980 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:38,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array12_pattern.c [2022-02-20 14:22:38,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb3be48d/ba88b97d8b3c4b02a0a068a848f31419/FLAGd9d8becfd [2022-02-20 14:22:39,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb3be48d/ba88b97d8b3c4b02a0a068a848f31419 [2022-02-20 14:22:39,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:39,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:39,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:39,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:39,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:39,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2993823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39, skipping insertion in model container [2022-02-20 14:22:39,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:39,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:39,531 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-patterns/array12_pattern.c[1349,1362] [2022-02-20 14:22:39,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:39,570 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:39,591 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-patterns/array12_pattern.c[1349,1362] [2022-02-20 14:22:39,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:39,619 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:39,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39 WrapperNode [2022-02-20 14:22:39,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:39,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:39,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:39,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:39,630 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:22:39" (1/1) ... [2022-02-20 14:22:39,638 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:22:39" (1/1) ... [2022-02-20 14:22:39,662 INFO L137 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2022-02-20 14:22:39,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:39,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:39,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:39,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:39,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:39,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:39,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:39,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:39,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (1/1) ... [2022-02-20 14:22:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:39,717 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:22:39,718 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:22:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:39,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:22:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:22:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:39,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:22:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:39,809 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:39,811 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:40,035 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:22:40,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:22:40,040 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:22:40,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:40 BoogieIcfgContainer [2022-02-20 14:22:40,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:22:40,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:22:40,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:22:40,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:22:40,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:22:39" (1/3) ... [2022-02-20 14:22:40,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f56a3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:40, skipping insertion in model container [2022-02-20 14:22:40,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:39" (2/3) ... [2022-02-20 14:22:40,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f56a3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:40, skipping insertion in model container [2022-02-20 14:22:40,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:40" (3/3) ... [2022-02-20 14:22:40,049 INFO L111 eAbstractionObserver]: Analyzing ICFG array12_pattern.c [2022-02-20 14:22:40,053 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:22:40,053 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:22:40,111 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:22:40,120 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:22:40,120 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:22:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:22:40,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:40,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:40,151 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2136223091, now seen corresponding path program 1 times [2022-02-20 14:22:40,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:40,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706505608] [2022-02-20 14:22:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:22:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:40,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-02-20 14:22:40,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-02-20 14:22:40,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-02-20 14:22:40,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #98#return; {34#false} is VALID [2022-02-20 14:22:40,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {33#true} is VALID [2022-02-20 14:22:40,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~post10#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {33#true} is VALID [2022-02-20 14:22:40,333 INFO L272 TraceCheckUtils]: 2: Hoare triple {33#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {33#true} is VALID [2022-02-20 14:22:40,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-02-20 14:22:40,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-02-20 14:22:40,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume true; {34#false} is VALID [2022-02-20 14:22:40,334 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {34#false} {33#true} #98#return; {34#false} is VALID [2022-02-20 14:22:40,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {34#false} is VALID [2022-02-20 14:22:40,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {34#false} is VALID [2022-02-20 14:22:40,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume false; {34#false} is VALID [2022-02-20 14:22:40,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} main_~row~0#1 := 0; {34#false} is VALID [2022-02-20 14:22:40,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {34#false} is VALID [2022-02-20 14:22:40,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {34#false} is VALID [2022-02-20 14:22:40,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == __VERIFIER_assert_~cond#1; {34#false} is VALID [2022-02-20 14:22:40,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 14:22:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:40,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:40,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706505608] [2022-02-20 14:22:40,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706505608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:40,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:40,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:22:40,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942618644] [2022-02-20 14:22:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:40,345 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:40,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:40,350 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:40,376 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:22:40,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:22:40,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:22:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:40,395 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:40,453 INFO L93 Difference]: Finished difference Result 57 states and 87 transitions. [2022-02-20 14:22:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:22:40,454 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:40,456 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 14:22:40,485 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 14:22:40,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 14:22:40,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:40,565 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:22:40,565 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:22:40,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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:22:40,569 INFO L933 BasicCegarLoop]: 36 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, 36 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:22:40,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:22:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 14:22:40,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:40,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:40,590 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:40,591 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:40,594 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:22:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:22:40,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:40,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:40,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 14:22:40,596 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 14:22:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:40,598 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:22:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:22:40,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:40,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:40,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:40,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 14:22:40,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-02-20 14:22:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:40,603 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 14:22:40,603 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:22:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:22:40,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:40,608 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:40,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:22:40,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1040942554, now seen corresponding path program 1 times [2022-02-20 14:22:40,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:40,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893308161] [2022-02-20 14:22:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:40,651 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:40,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052809265] [2022-02-20 14:22:40,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:40,676 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:22:40,740 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:22:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:40,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:22:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:40,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:40,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {201#true} is VALID [2022-02-20 14:22:40,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~post10#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {201#true} is VALID [2022-02-20 14:22:40,998 INFO L272 TraceCheckUtils]: 2: Hoare triple {201#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {201#true} is VALID [2022-02-20 14:22:40,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {201#true} ~cond := #in~cond; {215#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:22:40,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {219#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:40,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {219#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:41,000 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {219#(not (= |assume_abort_if_not_#in~cond| 0))} {201#true} #98#return; {226#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:41,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(< 0 ~ARR_SIZE~0)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {230#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:22:41,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {202#false} is VALID [2022-02-20 14:22:41,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {202#false} is VALID [2022-02-20 14:22:41,012 INFO L272 TraceCheckUtils]: 10: Hoare triple {202#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {202#false} is VALID [2022-02-20 14:22:41,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#false} ~cond := #in~cond; {202#false} is VALID [2022-02-20 14:22:41,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#false} assume !(0 == ~cond); {202#false} is VALID [2022-02-20 14:22:41,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#false} assume true; {202#false} is VALID [2022-02-20 14:22:41,013 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {202#false} {202#false} #100#return; {202#false} is VALID [2022-02-20 14:22:41,013 INFO L272 TraceCheckUtils]: 15: Hoare triple {202#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {202#false} is VALID [2022-02-20 14:22:41,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#false} ~cond := #in~cond; {202#false} is VALID [2022-02-20 14:22:41,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {202#false} assume !(0 == ~cond); {202#false} is VALID [2022-02-20 14:22:41,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {202#false} assume true; {202#false} is VALID [2022-02-20 14:22:41,014 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {202#false} {202#false} #102#return; {202#false} is VALID [2022-02-20 14:22:41,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {202#false} call write~int(main_~num~0#1 * main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index2~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index1~0#1, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {202#false} is VALID [2022-02-20 14:22:41,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {202#false} assume 0 == main_~temp~0#1; {202#false} is VALID [2022-02-20 14:22:41,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {202#false} main_~row~0#1 := 0; {202#false} is VALID [2022-02-20 14:22:41,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {202#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {202#false} is VALID [2022-02-20 14:22:41,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {202#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {202#false} is VALID [2022-02-20 14:22:41,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {202#false} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 14:22:41,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 14:22:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:41,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:41,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:41,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893308161] [2022-02-20 14:22:41,016 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:41,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052809265] [2022-02-20 14:22:41,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052809265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:41,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:41,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:22:41,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881003142] [2022-02-20 14:22:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 14:22:41,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:41,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:41,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:22:41,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:22:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:22:41,055 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,265 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-02-20 14:22:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:22:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 14:22:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-02-20 14:22:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-02-20 14:22:41,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-02-20 14:22:41,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:41,322 INFO L225 Difference]: With dead ends: 56 [2022-02-20 14:22:41,322 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:22:41,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:22:41,323 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:41,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 49 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:22:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:22:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-02-20 14:22:41,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:41,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,334 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,334 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,336 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 14:22:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 14:22:41,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:41,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:41,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 14:22:41,337 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 14:22:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,339 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 14:22:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 14:22:41,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:41,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:41,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:41,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-20 14:22:41,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2022-02-20 14:22:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:41,342 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-20 14:22:41,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 14:22:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:22:41,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:41,343 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:41,376 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:22:41,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:41,577 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:41,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash -66078307, now seen corresponding path program 1 times [2022-02-20 14:22:41,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:41,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287787027] [2022-02-20 14:22:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:41,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:41,595 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:41,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463294519] [2022-02-20 14:22:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:41,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:41,597 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:22:41,599 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:22:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:41,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:22:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:41,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:41,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {486#true} is VALID [2022-02-20 14:22:41,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~post10#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {486#true} is VALID [2022-02-20 14:22:41,765 INFO L272 TraceCheckUtils]: 2: Hoare triple {486#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {486#true} is VALID [2022-02-20 14:22:41,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {486#true} ~cond := #in~cond; {486#true} is VALID [2022-02-20 14:22:41,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#true} assume !(0 == ~cond); {486#true} is VALID [2022-02-20 14:22:41,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 14:22:41,766 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {486#true} {486#true} #98#return; {486#true} is VALID [2022-02-20 14:22:41,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {512#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:22:41,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {516#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:41,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {487#false} is VALID [2022-02-20 14:22:41,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {487#false} is VALID [2022-02-20 14:22:41,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {487#false} is VALID [2022-02-20 14:22:41,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {487#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {487#false} is VALID [2022-02-20 14:22:41,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {487#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {487#false} is VALID [2022-02-20 14:22:41,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#false} ~cond := #in~cond; {487#false} is VALID [2022-02-20 14:22:41,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#false} assume !(0 == ~cond); {487#false} is VALID [2022-02-20 14:22:41,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#false} assume true; {487#false} is VALID [2022-02-20 14:22:41,769 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {487#false} {487#false} #100#return; {487#false} is VALID [2022-02-20 14:22:41,769 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {487#false} is VALID [2022-02-20 14:22:41,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {487#false} ~cond := #in~cond; {487#false} is VALID [2022-02-20 14:22:41,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {487#false} assume !(0 == ~cond); {487#false} is VALID [2022-02-20 14:22:41,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {487#false} assume true; {487#false} is VALID [2022-02-20 14:22:41,770 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {487#false} {487#false} #102#return; {487#false} is VALID [2022-02-20 14:22:41,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#false} call write~int(main_~num~0#1 * main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index2~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index1~0#1, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {487#false} is VALID [2022-02-20 14:22:41,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {487#false} assume 0 == main_~temp~0#1; {487#false} is VALID [2022-02-20 14:22:41,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {487#false} main_~row~0#1 := 0; {487#false} is VALID [2022-02-20 14:22:41,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {487#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {487#false} is VALID [2022-02-20 14:22:41,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {487#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {487#false} is VALID [2022-02-20 14:22:41,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {487#false} main_#t~post10#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {487#false} is VALID [2022-02-20 14:22:41,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {487#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {487#false} is VALID [2022-02-20 14:22:41,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {487#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {487#false} is VALID [2022-02-20 14:22:41,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {487#false} assume 0 == __VERIFIER_assert_~cond#1; {487#false} is VALID [2022-02-20 14:22:41,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {487#false} assume !false; {487#false} is VALID [2022-02-20 14:22:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:22:41,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:41,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:41,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287787027] [2022-02-20 14:22:41,773 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:41,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463294519] [2022-02-20 14:22:41,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463294519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:41,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:41,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:22:41,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389104206] [2022-02-20 14:22:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-02-20 14:22:41,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:41,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:41,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:22:41,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:22:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:22:41,795 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,884 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-02-20 14:22:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:22:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-02-20 14:22:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-02-20 14:22:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-02-20 14:22:41,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2022-02-20 14:22:41,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:41,934 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:22:41,934 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:22:41,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:22:41,935 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:41,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:22:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-02-20 14:22:41,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:41,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,952 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,952 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,954 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 14:22:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 14:22:41,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:41,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:41,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-02-20 14:22:41,955 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-02-20 14:22:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:41,956 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 14:22:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 14:22:41,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:41,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:41,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:41,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 14:22:41,958 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 33 [2022-02-20 14:22:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:41,959 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 14:22:41,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 14:22:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:22:41,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:41,960 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:41,994 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:22:42,175 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,SelfDestructingSolverStorable2 [2022-02-20 14:22:42,176 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1831364287, now seen corresponding path program 1 times [2022-02-20 14:22:42,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:42,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812053684] [2022-02-20 14:22:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:42,197 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:42,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196198596] [2022-02-20 14:22:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:42,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:42,199 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:22:42,201 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:22:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:42,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 14:22:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:42,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:42,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2022-02-20 14:22:42,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-02-20 14:22:43,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 91 [2022-02-20 14:22:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:43,856 INFO L356 Elim1Store]: treesize reduction 372, result has 0.3 percent of original size [2022-02-20 14:22:43,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 181 [2022-02-20 14:22:49,651 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 283 treesize of output 271 [2022-02-20 14:22:49,818 INFO L356 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-02-20 14:22:49,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1181 treesize of output 1167 [2022-02-20 14:22:50,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {789#true} is VALID [2022-02-20 14:22:50,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~post10#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {789#true} is VALID [2022-02-20 14:22:50,217 INFO L272 TraceCheckUtils]: 2: Hoare triple {789#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {789#true} is VALID [2022-02-20 14:22:50,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {789#true} ~cond := #in~cond; {789#true} is VALID [2022-02-20 14:22:50,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {789#true} assume !(0 == ~cond); {789#true} is VALID [2022-02-20 14:22:50,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#true} assume true; {789#true} is VALID [2022-02-20 14:22:50,218 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {789#true} {789#true} #98#return; {789#true} is VALID [2022-02-20 14:22:50,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {815#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:22:50,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {815#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {819#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:50,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {819#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {823#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:50,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {827#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0))} is VALID [2022-02-20 14:22:50,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:50,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:50,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:50,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:50,229 INFO L272 TraceCheckUtils]: 15: Hoare triple {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {844#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} ~cond := #in~cond; {848#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {848#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume !(0 == ~cond); {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume true; {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,234 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} {831#(and (< 0 ~ARR_SIZE~0) (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} #100#return; {859#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:50,235 INFO L272 TraceCheckUtils]: 20: Hoare triple {859#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {844#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} ~cond := #in~cond; {848#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {848#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume !(0 == ~cond); {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume true; {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:22:50,240 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {852#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} {859#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} #102#return; {875#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:22:50,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {875#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call write~int(main_~num~0#1 * main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index2~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index1~0#1, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {879#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))))} is VALID [2022-02-20 14:22:50,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {879#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))))} assume 0 == main_~temp~0#1; {879#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))))} is VALID [2022-02-20 14:22:50,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {879#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))))} main_~row~0#1 := 0; {886#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:22:50,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {886#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {890#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:50,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {890#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int) (|ULTIMATE.start_main_~index2~0#1| Int)) (and (exists ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= v_DerPreprocessor_1 (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)))) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_2) (= (select (store (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) v_DerPreprocessor_1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4))) v_DerPreprocessor_2) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) v_DerPreprocessor_3))) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| 4) (* |ULTIMATE.start_main_~index2~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)))) 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem12#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:22:50,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} main_#t~post11#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:22:50,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:22:50,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} main_#t~post10#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:22:50,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:22:50,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {894#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 1))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {910#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:22:50,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {910#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {790#false} is VALID [2022-02-20 14:22:50,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {790#false} assume !false; {790#false} is VALID [2022-02-20 14:22:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:50,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:19,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:19,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812053684] [2022-02-20 14:23:19,722 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:19,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196198596] [2022-02-20 14:23:19,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196198596] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:23:19,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:23:19,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 14:23:19,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666396409] [2022-02-20 14:23:19,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-20 14:23:19,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:19,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:19,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:19,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:23:19,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:23:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=431, Unknown=1, NotChecked=0, Total=506 [2022-02-20 14:23:19,818 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:20,893 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-02-20 14:23:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:23:20,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-20 14:23:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 105 transitions. [2022-02-20 14:23:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 105 transitions. [2022-02-20 14:23:20,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 105 transitions. [2022-02-20 14:23:21,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:21,055 INFO L225 Difference]: With dead ends: 95 [2022-02-20 14:23:21,055 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 14:23:21,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=116, Invalid=753, Unknown=1, NotChecked=0, Total=870 [2022-02-20 14:23:21,056 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:21,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 222 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 141 Unchecked, 0.2s Time] [2022-02-20 14:23:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 14:23:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-02-20 14:23:21,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:21,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:21,111 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:21,112 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:21,116 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-02-20 14:23:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-02-20 14:23:21,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:21,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:21,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 68 states. [2022-02-20 14:23:21,122 INFO L87 Difference]: Start difference. First operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 68 states. [2022-02-20 14:23:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:21,128 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-02-20 14:23:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-02-20 14:23:21,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:21,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:21,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:21,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-02-20 14:23:21,133 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 37 [2022-02-20 14:23:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:21,135 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-02-20 14:23:21,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 14:23:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:23:21,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:21,138 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:21,157 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:23:21,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:21,357 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1155769123, now seen corresponding path program 2 times [2022-02-20 14:23:21,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:21,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699548967] [2022-02-20 14:23:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:21,387 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:21,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086463214] [2022-02-20 14:23:21,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:21,395 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:23:21,413 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:23:21,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:21,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:21,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:21,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:21,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1327#true} is VALID [2022-02-20 14:23:21,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~post10#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1327#true} is VALID [2022-02-20 14:23:21,660 INFO L272 TraceCheckUtils]: 2: Hoare triple {1327#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1327#true} is VALID [2022-02-20 14:23:21,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 14:23:21,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {1327#true} assume !(0 == ~cond); {1327#true} is VALID [2022-02-20 14:23:21,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 14:23:21,660 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1327#true} {1327#true} #98#return; {1327#true} is VALID [2022-02-20 14:23:21,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1327#true} is VALID [2022-02-20 14:23:21,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {1327#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:21,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:21,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1363#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:21,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {1363#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,673 INFO L272 TraceCheckUtils]: 15: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume true; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,674 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1367#(<= ~ARR_SIZE~0 1)} {1367#(<= ~ARR_SIZE~0 1)} #100#return; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,675 INFO L272 TraceCheckUtils]: 20: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume true; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,676 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1367#(<= ~ARR_SIZE~0 1)} {1367#(<= ~ARR_SIZE~0 1)} #102#return; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} call write~int(main_~num~0#1 * main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index2~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index1~0#1, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} main_~row~0#1 := 0; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1419#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:21,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {1419#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem12#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1419#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:21,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post11#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1426#(and (<= ~ARR_SIZE~0 1) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:21,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {1426#(and (<= ~ARR_SIZE~0 1) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem12#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {1328#false} main_#t~post11#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {1328#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {1328#false} main_#t~post10#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {1328#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {1328#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {1328#false} assume 0 == __VERIFIER_assert_~cond#1; {1328#false} is VALID [2022-02-20 14:23:21,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-02-20 14:23:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:21,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:21,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-02-20 14:23:21,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {1328#false} assume 0 == __VERIFIER_assert_~cond#1; {1328#false} is VALID [2022-02-20 14:23:21,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {1328#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1328#false} is VALID [2022-02-20 14:23:21,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {1328#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1328#false} is VALID [2022-02-20 14:23:21,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {1328#false} main_#t~post10#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1328#false} is VALID [2022-02-20 14:23:21,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {1328#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1328#false} is VALID [2022-02-20 14:23:21,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {1328#false} main_#t~post11#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1328#false} is VALID [2022-02-20 14:23:21,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {1472#(not (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem12#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1328#false} is VALID [2022-02-20 14:23:21,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {1476#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} main_#t~post11#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1472#(not (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:21,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {1476#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem12#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1476#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:21,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1476#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:21,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} main_~row~0#1 := 0; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} call write~int(main_~num~0#1 * main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index2~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index1~0#1, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,814 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1327#true} {1367#(<= ~ARR_SIZE~0 1)} #102#return; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 14:23:21,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {1327#true} assume !(0 == ~cond); {1327#true} is VALID [2022-02-20 14:23:21,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 14:23:21,815 INFO L272 TraceCheckUtils]: 20: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1327#true} is VALID [2022-02-20 14:23:21,815 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1327#true} {1367#(<= ~ARR_SIZE~0 1)} #100#return; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 14:23:21,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1327#true} assume !(0 == ~cond); {1327#true} is VALID [2022-02-20 14:23:21,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 14:23:21,816 INFO L272 TraceCheckUtils]: 15: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1327#true} is VALID [2022-02-20 14:23:21,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1367#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {1363#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1367#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:21,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1363#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:21,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:21,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1327#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1356#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:21,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1327#true} is VALID [2022-02-20 14:23:21,819 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1327#true} {1327#true} #98#return; {1327#true} is VALID [2022-02-20 14:23:21,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-02-20 14:23:21,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {1327#true} assume !(0 == ~cond); {1327#true} is VALID [2022-02-20 14:23:21,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {1327#true} ~cond := #in~cond; {1327#true} is VALID [2022-02-20 14:23:21,820 INFO L272 TraceCheckUtils]: 2: Hoare triple {1327#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1327#true} is VALID [2022-02-20 14:23:21,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~post10#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1327#true} is VALID [2022-02-20 14:23:21,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1327#true} is VALID [2022-02-20 14:23:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:21,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:21,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699548967] [2022-02-20 14:23:21,821 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:21,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086463214] [2022-02-20 14:23:21,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086463214] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:21,821 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:21,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:23:21,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937613861] [2022-02-20 14:23:21,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:21,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-02-20 14:23:21,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:21,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:21,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:21,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:23:21,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:23:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:23:21,853 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:22,617 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2022-02-20 14:23:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:23:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-02-20 14:23:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-02-20 14:23:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-02-20 14:23:22,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2022-02-20 14:23:22,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:22,707 INFO L225 Difference]: With dead ends: 137 [2022-02-20 14:23:22,707 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 14:23:22,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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:23:22,708 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:22,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 118 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:23:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 14:23:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2022-02-20 14:23:22,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:22,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 82 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:23:22,799 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 82 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:23:22,799 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 82 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:23:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:22,802 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-02-20 14:23:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-02-20 14:23:22,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:22,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:22,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 112 states. [2022-02-20 14:23:22,803 INFO L87 Difference]: Start difference. First operand has 82 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 112 states. [2022-02-20 14:23:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:22,822 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-02-20 14:23:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-02-20 14:23:22,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:22,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:22,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:22,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:23:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2022-02-20 14:23:22,826 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 39 [2022-02-20 14:23:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:22,826 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2022-02-20 14:23:22,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2022-02-20 14:23:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:23:22,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:22,827 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:22,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:23,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:23,049 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1584262531, now seen corresponding path program 3 times [2022-02-20 14:23:23,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:23,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278063892] [2022-02-20 14:23:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:23,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:23,092 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:23,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31670220] [2022-02-20 14:23:23,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:23,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:23,102 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:23:23,103 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:23:23,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:23:23,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:23,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 14:23:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:23,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:23,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 86 [2022-02-20 14:23:24,992 INFO L356 Elim1Store]: treesize reduction 100, result has 45.4 percent of original size [2022-02-20 14:23:24,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 260 [2022-02-20 14:23:29,901 INFO L244 Elim1Store]: Index analysis took 595 ms [2022-02-20 14:23:31,386 INFO L356 Elim1Store]: treesize reduction 499, result has 5.3 percent of original size [2022-02-20 14:23:31,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 205 treesize of output 74