./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-fpi/ss2.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 e3a2069d11be89fa2c8e98300820eccf9d61bcc6c7ca5fd30afcaf42942b8548 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:14:18,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:14:18,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:14:18,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:14:18,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:14:18,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:14:18,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:14:18,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:14:18,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:14:18,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:14:18,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:14:18,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:14:18,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:14:18,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:14:18,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:14:18,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:14:18,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:14:18,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:14:18,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:14:18,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:14:18,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:14:18,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:14:18,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:14:18,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:14:18,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:14:18,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:14:18,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:14:18,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:14:18,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:14:18,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:14:18,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:14:18,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:14:18,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:14:18,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:14:18,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:14:18,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:14:18,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:14:18,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:14:18,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:14:18,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:14:18,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:14:18,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:14:18,417 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:14:18,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:14:18,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:14:18,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:14:18,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:14:18,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:14:18,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:14:18,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:14:18,421 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:14:18,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:14:18,422 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:14:18,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:14:18,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:14:18,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:14:18,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:14:18,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:14:18,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:14:18,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:14:18,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:14:18,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:14:18,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:14:18,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:14:18,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:14:18,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:14:18,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:14:18,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:14:18,425 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:14:18,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:14:18,426 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:14:18,426 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> e3a2069d11be89fa2c8e98300820eccf9d61bcc6c7ca5fd30afcaf42942b8548 [2023-02-17 00:14:18,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:14:18,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:14:18,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:14:18,682 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:14:18,682 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:14:18,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss2.c [2023-02-17 00:14:19,729 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:14:19,876 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:14:19,876 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c [2023-02-17 00:14:19,881 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b014464/7b977c2c452d49e4ba1dd8de4f37d940/FLAG6c6ee7caa [2023-02-17 00:14:19,895 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b014464/7b977c2c452d49e4ba1dd8de4f37d940 [2023-02-17 00:14:19,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:14:19,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:14:19,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:14:19,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:14:19,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:14:19,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:14:19" (1/1) ... [2023-02-17 00:14:19,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40858d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:19, skipping insertion in model container [2023-02-17 00:14:19,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:14:19" (1/1) ... [2023-02-17 00:14:19,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:14:19,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:14:20,040 WARN L237 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-fpi/ss2.c[586,599] [2023-02-17 00:14:20,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:14:20,078 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:14:20,089 WARN L237 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-fpi/ss2.c[586,599] [2023-02-17 00:14:20,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:14:20,119 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:14:20,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20 WrapperNode [2023-02-17 00:14:20,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:14:20,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:14:20,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:14:20,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:14:20,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,155 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2023-02-17 00:14:20,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:14:20,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:14:20,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:14:20,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:14:20,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:14:20,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:14:20,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:14:20,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:14:20,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (1/1) ... [2023-02-17 00:14:20,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:14:20,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:20,216 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) [2023-02-17 00:14:20,255 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 [2023-02-17 00:14:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:14:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 00:14:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:14:20,316 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:14:20,317 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:14:20,522 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:14:20,526 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:14:20,526 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-17 00:14:20,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:14:20 BoogieIcfgContainer [2023-02-17 00:14:20,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:14:20,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:14:20,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:14:20,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:14:20,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:14:19" (1/3) ... [2023-02-17 00:14:20,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c63b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:14:20, skipping insertion in model container [2023-02-17 00:14:20,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:14:20" (2/3) ... [2023-02-17 00:14:20,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c63b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:14:20, skipping insertion in model container [2023-02-17 00:14:20,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:14:20" (3/3) ... [2023-02-17 00:14:20,533 INFO L112 eAbstractionObserver]: Analyzing ICFG ss2.c [2023-02-17 00:14:20,556 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:14:20,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:14:20,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:14:20,599 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75c7e51c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:14:20,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:14:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:14:20,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:20,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:14:20,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -642180410, now seen corresponding path program 1 times [2023-02-17 00:14:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:20,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224644863] [2023-02-17 00:14:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:14:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:20,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224644863] [2023-02-17 00:14:20,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 00:14:20,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345594138] [2023-02-17 00:14:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:20,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:20,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:20,787 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) [2023-02-17 00:14:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 00:14:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:14:20,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 00:14:20,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:20,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 00:14:20,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345594138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:14:20,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:14:20,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 00:14:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018148811] [2023-02-17 00:14:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:14:20,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 00:14:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 00:14:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 00:14:20,935 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:20,968 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2023-02-17 00:14:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 00:14:20,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 00:14:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:20,975 INFO L225 Difference]: With dead ends: 62 [2023-02-17 00:14:20,975 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 00:14:20,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 00:14:20,982 INFO L413 NwaCegarLoop]: 40 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, 40 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 [2023-02-17 00:14:20,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:14:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 00:14:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 00:14:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-17 00:14:21,008 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2023-02-17 00:14:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:21,008 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-17 00:14:21,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-17 00:14:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:14:21,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:21,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:14:21,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 00:14:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 00:14:21,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1011332042, now seen corresponding path program 1 times [2023-02-17 00:14:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059812864] [2023-02-17 00:14:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:14:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:21,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059812864] [2023-02-17 00:14:21,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 00:14:21,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191890696] [2023-02-17 00:14:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:21,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:21,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:21,257 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) [2023-02-17 00:14:21,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 00:14:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:14:21,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 00:14:21,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:21,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 00:14:21,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191890696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:14:21,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:14:21,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 00:14:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519735933] [2023-02-17 00:14:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:14:21,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 00:14:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 00:14:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:14:21,328 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:21,382 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2023-02-17 00:14:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 00:14:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 00:14:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:21,384 INFO L225 Difference]: With dead ends: 69 [2023-02-17 00:14:21,384 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 00:14:21,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:14:21,385 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:21,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 19 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:14:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 00:14:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-02-17 00:14:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-02-17 00:14:21,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2023-02-17 00:14:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-02-17 00:14:21,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-02-17 00:14:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 00:14:21,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:21,392 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-02-17 00:14:21,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 00:14:21,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 00:14:21,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1890076394, now seen corresponding path program 1 times [2023-02-17 00:14:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:21,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686642671] [2023-02-17 00:14:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:21,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:14:21,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915085172] [2023-02-17 00:14:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:21,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:21,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:21,643 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) [2023-02-17 00:14:21,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 00:14:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:14:21,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-17 00:14:21,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:21,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 00:14:21,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:21,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 00:14:21,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:21,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-17 00:14:21,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:21,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-02-17 00:14:21,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:21,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2023-02-17 00:14:21,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:21,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2023-02-17 00:14:21,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:21,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:21,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 41 [2023-02-17 00:14:22,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:22,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2023-02-17 00:14:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:22,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:22,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:22,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686642671] [2023-02-17 00:14:22,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:14:22,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915085172] [2023-02-17 00:14:22,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915085172] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:22,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:14:22,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2023-02-17 00:14:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883232588] [2023-02-17 00:14:22,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:22,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 00:14:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 00:14:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 00:14:22,828 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:25,911 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2023-02-17 00:14:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 00:14:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-17 00:14:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:25,913 INFO L225 Difference]: With dead ends: 99 [2023-02-17 00:14:25,913 INFO L226 Difference]: Without dead ends: 97 [2023-02-17 00:14:25,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=511, Invalid=3271, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 00:14:25,915 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:25,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 225 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-17 00:14:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-17 00:14:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2023-02-17 00:14:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-17 00:14:25,940 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 32 [2023-02-17 00:14:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:25,941 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-17 00:14:25,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-17 00:14:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 00:14:25,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:25,943 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-02-17 00:14:25,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 00:14:26,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:26,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1237633832, now seen corresponding path program 2 times [2023-02-17 00:14:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:26,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837566243] [2023-02-17 00:14:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:26,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:14:26,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126046208] [2023-02-17 00:14:26,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:14:26,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:26,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:26,172 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) [2023-02-17 00:14:26,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 00:14:26,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:14:26,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:14:26,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:14:26,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:14:26,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:14:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837566243] [2023-02-17 00:14:26,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:14:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126046208] [2023-02-17 00:14:26,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126046208] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:26,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:14:26,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-17 00:14:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011680950] [2023-02-17 00:14:26,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:26,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 00:14:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 00:14:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 00:14:26,259 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:26,393 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2023-02-17 00:14:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:14:26,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-17 00:14:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:26,396 INFO L225 Difference]: With dead ends: 156 [2023-02-17 00:14:26,396 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 00:14:26,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-17 00:14:26,397 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:26,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 50 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:14:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 00:14:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2023-02-17 00:14:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-02-17 00:14:26,417 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 34 [2023-02-17 00:14:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:26,418 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-02-17 00:14:26,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-02-17 00:14:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 00:14:26,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:26,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2023-02-17 00:14:26,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 00:14:26,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:26,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash 999316006, now seen corresponding path program 3 times [2023-02-17 00:14:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:26,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930832353] [2023-02-17 00:14:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:26,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:14:26,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614377751] [2023-02-17 00:14:26,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:14:26,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:26,657 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) [2023-02-17 00:14:26,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 00:14:26,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 00:14:26,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:14:26,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:14:26,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 00:14:26,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 00:14:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:26,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930832353] [2023-02-17 00:14:26,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:14:26,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614377751] [2023-02-17 00:14:26,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614377751] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:26,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:14:26,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-17 00:14:26,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583618560] [2023-02-17 00:14:26,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:26,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 00:14:26,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:26,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 00:14:26,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 00:14:26,751 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:26,863 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-17 00:14:26,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:14:26,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-17 00:14:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:26,864 INFO L225 Difference]: With dead ends: 81 [2023-02-17 00:14:26,864 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 00:14:26,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-17 00:14:26,865 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:26,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 40 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:14:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 00:14:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2023-02-17 00:14:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-02-17 00:14:26,869 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2023-02-17 00:14:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:26,870 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-02-17 00:14:26,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:14:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-02-17 00:14:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 00:14:26,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:26,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:14:26,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 00:14:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:27,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:27,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 772187038, now seen corresponding path program 4 times [2023-02-17 00:14:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:27,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507836973] [2023-02-17 00:14:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:27,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:14:27,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898770967] [2023-02-17 00:14:27,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:14:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:27,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:27,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:14:27,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 00:14:27,210 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:14:27,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:14:27,213 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-17 00:14:27,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:27,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 00:14:27,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 00:14:27,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 00:14:27,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2023-02-17 00:14:27,284 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:27,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:27,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2023-02-17 00:14:27,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:27,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:27,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2023-02-17 00:14:27,368 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:27,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-02-17 00:14:27,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2023-02-17 00:14:27,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:27,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:27,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2023-02-17 00:14:27,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-02-17 00:14:27,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:27,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2023-02-17 00:14:27,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2023-02-17 00:14:27,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:14:27,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:27,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2023-02-17 00:14:27,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2023-02-17 00:14:27,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 39 [2023-02-17 00:14:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:27,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:47,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507836973] [2023-02-17 00:14:47,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:14:47,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898770967] [2023-02-17 00:14:47,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898770967] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:47,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:14:47,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2023-02-17 00:14:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353627021] [2023-02-17 00:14:47,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:47,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-17 00:14:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-17 00:14:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3416, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 00:14:47,539 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:16:00,450 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse75 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse85 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (+ .cse75 (select .cse46 .cse85))) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse19 (+ 0 1)) (.cse47 (< .cse1 c_~N~0)) (.cse2 (+ .cse1 1)) (.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse30)))) (let ((.cse29 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (store .cse46 .cse85 1)) (.cse18 (+ (* .cse1 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (< .cse2 c_~N~0)) (.cse33 (not .cse47)) (.cse0 (+ .cse19 1)) (.cse31 (* (+ c_~N~0 2) c_~N~0)) (.cse8 (+ (* 8 .cse19) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 0)))) (and (forall ((~N~0 Int)) (or (< .cse0 ~N~0) (not (< .cse1 ~N~0)) (< .cse2 ~N~0) (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse10 (let ((.cse16 (store .cse17 .cse18 1))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (+ (select .cse16 .cse6) (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse15)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse15))))))))) (let ((.cse12 (store (store (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse9 (+ (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse4 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 .cse6 .cse9))) (store .cse11 .cse8 (+ (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (let ((.cse7 (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse9))) (+ .cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))))))) (not (< .cse19 ~N~0)))) (or (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse29 .cse18) .cse30))))) (let ((.cse27 (store (store (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse24 (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse20 (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse26 (store .cse27 .cse6 .cse24))) (store .cse26 .cse8 (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (let ((.cse23 (+ (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse24))) (+ .cse23 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse22))))))) .cse31) .cse32 .cse33) (forall ((~N~0 Int)) (or (< .cse0 ~N~0) (not (< .cse1 ~N~0)) (< .cse2 ~N~0) (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse39 (let ((.cse45 (store .cse46 .cse18 1))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse44 (+ (select .cse45 .cse6) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse44))))))))) (let ((.cse41 (store (store (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse38 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse35 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (store .cse41 .cse6 .cse38))) (store .cse40 .cse8 (+ 0 (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (let ((.cse37 (+ .cse38 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse37)))) (+ .cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse34)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))))))) (not (< .cse19 ~N~0)))) (or .cse47 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse55 (store (store .cse29 .cse6 0) .cse8 0))) (let ((.cse52 (+ 0 (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse48 (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse54 (store .cse55 .cse6 .cse52))) (store .cse54 .cse8 (+ 0 (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (let ((.cse51 (+ (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse52))) (+ .cse51 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse51)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse50)))))) .cse31)) (forall ((~N~0 Int)) (or (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse61 (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse66 (+ (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse17 .cse6)))) (+ (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse66)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse66)))))))) (let ((.cse63 (store (store (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse60 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse63) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse57 (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (store .cse63 .cse6 .cse60))) (store .cse62 .cse8 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (let ((.cse59 (+ (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse60))) (+ (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse59)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse59)))) (+ .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))))))) (< .cse0 ~N~0) (< .cse1 ~N~0) (not (< .cse19 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or (= .cse31 (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 (select .cse46 .cse18)))))) (let ((.cse74 (store (store (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse71 (+ (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse67 (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse73 (store .cse74 .cse6 .cse71))) (store .cse73 .cse8 (+ (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (let ((.cse70 (+ .cse71 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse70)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse70)))) (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse69)))))))) .cse32 .cse33) (or (< .cse0 c_~N~0) (not (< .cse19 c_~N~0)) (= .cse31 (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse84 (+ .cse75 (select .cse46 .cse6)))) (+ .cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse84)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))) (let ((.cse83 (store (store (select .cse81 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse80 (+ 0 (select (select (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| .cse83) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse77 (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse82 (store .cse83 .cse6 .cse80))) (store .cse82 .cse8 (+ (select (select (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| .cse82) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse78 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (let ((.cse79 (+ (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse80))) (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse79)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse79)))) (+ .cse76 (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse76)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))))))))))))) is different from false [2023-02-17 00:16:04,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse13 (+ .cse12 1)) (.cse27 (+ (* .cse12 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (store .cse10 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse11 (+ .cse28 1)) (.cse0 (* (+ c_~N~0 2) c_~N~0)) (.cse6 (+ (* 8 .cse28) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 0)))) (and (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= .cse0 (let ((.cse9 (store (store .cse10 .cse4 0) .cse6 0))) (let ((.cse7 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (store .cse9 .cse4 .cse7))) (store .cse8 .cse6 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (let ((.cse5 (+ .cse7 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ .cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3)))))))) (forall ((~N~0 Int)) (or (< .cse11 ~N~0) (not (< .cse12 ~N~0)) (< .cse13 ~N~0) (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse19 (let ((.cse25 (store .cse26 .cse27 1))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse24 (+ (select .cse25 .cse4) (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse24))))))))) (let ((.cse21 (store (store (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4 0) .cse6 0))) (let ((.cse18 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse15 (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (store .cse21 .cse4 .cse18))) (store .cse20 .cse6 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse18))) (+ .cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (+ .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse14)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))))) (not (< .cse28 ~N~0)))) (forall ((~N~0 Int)) (or (< .cse11 ~N~0) (not (< .cse12 ~N~0)) (< .cse13 ~N~0) (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse34 (let ((.cse40 (store .cse10 .cse27 1))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40))) (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse39 (+ (select .cse40 .cse4) (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse39))))))))) (let ((.cse36 (store (store (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4 0) .cse6 0))) (let ((.cse33 (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (store .cse36 .cse4 .cse33))) (store .cse35 .cse6 (+ 0 (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (let ((.cse32 (+ .cse33 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse32)))) (+ .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))))) (not (< .cse28 ~N~0)))) (forall ((~N~0 Int)) (or (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse46 (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26))) (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse51 (+ (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse26 .cse4)))) (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse51)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse51)))))))) (let ((.cse48 (store (store (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4 0) .cse6 0))) (let ((.cse45 (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse42 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (store .cse48 .cse4 .cse45))) (store .cse47 .cse6 (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (let ((.cse44 (+ (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse45))) (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse44)))) (+ .cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))))) (< .cse11 ~N~0) (< .cse12 ~N~0) (not (< .cse28 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or (< .cse11 c_~N~0) (not (< .cse28 c_~N~0)) (< .cse12 c_~N~0) (= .cse0 (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse60 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse61 (+ (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse10 .cse4)))) (+ .cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse61)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))))) (let ((.cse59 (store (store (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4 0) .cse6 0))) (let ((.cse56 (+ 0 (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse53 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse58 (store .cse59 .cse4 .cse56))) (store .cse58 .cse6 (+ (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (let ((.cse55 (+ (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse56))) (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse55)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse55)))) (+ .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))))))))) is different from false [2023-02-17 00:18:06,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:08,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:10,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:12,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:14,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:41,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:44,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:51,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:18:58,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:00,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:04,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:06,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:08,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1]