./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 21:52:15,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 21:52:15,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 21:52:15,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 21:52:15,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 21:52:15,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 21:52:15,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 21:52:15,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 21:52:15,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 21:52:15,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 21:52:15,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 21:52:15,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 21:52:15,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 21:52:15,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 21:52:15,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 21:52:15,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 21:52:15,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 21:52:15,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 21:52:15,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 21:52:15,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 21:52:15,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 21:52:15,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 21:52:15,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 21:52:15,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 21:52:15,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 21:52:15,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 21:52:15,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 21:52:15,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 21:52:15,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 21:52:15,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 21:52:15,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 21:52:15,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 21:52:15,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 21:52:15,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 21:52:15,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 21:52:15,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 21:52:15,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 21:52:15,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 21:52:15,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 21:52:15,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 21:52:15,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 21:52:15,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 21:52:15,228 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 21:52:15,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 21:52:15,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 21:52:15,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 21:52:15,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 21:52:15,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 21:52:15,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 21:52:15,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 21:52:15,231 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 21:52:15,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 21:52:15,232 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 21:52:15,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 21:52:15,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 21:52:15,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 21:52:15,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 21:52:15,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 21:52:15,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 21:52:15,234 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 21:52:15,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 21:52:15,234 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 21:52:15,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 21:52:15,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 21:52:15,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 21:52:15,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 21:52:15,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 21:52:15,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 21:52:15,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 21:52:15,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 21:52:15,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 21:52:15,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 21:52:15,237 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 21:52:15,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 21:52:15,238 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 21:52:15,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 21:52:15,238 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 21:52:15,238 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 21:52:15,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 21:52:15,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 21:52:15,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 21:52:15,487 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 21:52:15,488 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 21:52:15,490 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 21:52:16,653 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 21:52:16,822 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 21:52:16,823 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c [2023-02-17 21:52:16,828 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a769bd/a11fb08652774054b5d8cf742dc5d3aa/FLAG45acfb547 [2023-02-17 21:52:16,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a769bd/a11fb08652774054b5d8cf742dc5d3aa [2023-02-17 21:52:16,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 21:52:16,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 21:52:16,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 21:52:16,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 21:52:16,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 21:52:16,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:52:16" (1/1) ... [2023-02-17 21:52:16,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4f7f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:16, skipping insertion in model container [2023-02-17 21:52:16,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:52:16" (1/1) ... [2023-02-17 21:52:16,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 21:52:16,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 21:52:16,983 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 21:52:17,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 21:52:17,011 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 21:52:17,021 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 21:52:17,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 21:52:17,039 INFO L208 MainTranslator]: Completed translation [2023-02-17 21:52:17,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17 WrapperNode [2023-02-17 21:52:17,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 21:52:17,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 21:52:17,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 21:52:17,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 21:52:17,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,070 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2023-02-17 21:52:17,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 21:52:17,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 21:52:17,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 21:52:17,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 21:52:17,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 21:52:17,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 21:52:17,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 21:52:17,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 21:52:17,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (1/1) ... [2023-02-17 21:52:17,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 21:52:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:17,134 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 21:52:17,139 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 21:52:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 21:52:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 21:52:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 21:52:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 21:52:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 21:52:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 21:52:17,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 21:52:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 21:52:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 21:52:17,264 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 21:52:17,268 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 21:52:17,471 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 21:52:17,476 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 21:52:17,476 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-17 21:52:17,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:52:17 BoogieIcfgContainer [2023-02-17 21:52:17,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 21:52:17,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 21:52:17,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 21:52:17,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 21:52:17,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:52:16" (1/3) ... [2023-02-17 21:52:17,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ca70ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:52:17, skipping insertion in model container [2023-02-17 21:52:17,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:52:17" (2/3) ... [2023-02-17 21:52:17,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ca70ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:52:17, skipping insertion in model container [2023-02-17 21:52:17,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:52:17" (3/3) ... [2023-02-17 21:52:17,518 INFO L112 eAbstractionObserver]: Analyzing ICFG ss2.c [2023-02-17 21:52:17,546 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 21:52:17,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 21:52:17,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 21:52:17,607 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;@5aa59d64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 21:52:17,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 21:52:17,611 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 21:52:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 21:52:17,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:52:17,617 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 21:52:17,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:52:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:52:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash -642180410, now seen corresponding path program 1 times [2023-02-17 21:52:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:52:17,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31555328] [2023-02-17 21:52:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:52:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:52:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:52:17,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31555328] [2023-02-17 21:52:17,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 21:52:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705789835] [2023-02-17 21:52:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:17,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:52:17,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:17,801 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 21:52:17,802 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 21:52:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:52:17,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 21:52:17,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:52:17,907 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 21:52:17,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 21:52:17,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705789835] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 21:52:17,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 21:52:17,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 21:52:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113041754] [2023-02-17 21:52:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 21:52:17,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 21:52:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:52:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 21:52:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 21:52:17,942 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 21:52:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:52:17,955 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2023-02-17 21:52:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 21:52:17,957 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 21:52:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:52:17,963 INFO L225 Difference]: With dead ends: 62 [2023-02-17 21:52:17,963 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 21:52:17,966 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 21:52:17,969 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 21:52:17,969 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 21:52:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 21:52:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 21:52:17,995 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 21:52:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-17 21:52:17,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2023-02-17 21:52:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:52:18,000 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-17 21:52:18,000 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 21:52:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-17 21:52:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 21:52:18,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:52:18,002 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 21:52:18,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 21:52:18,208 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 21:52:18,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:52:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:52:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1011332042, now seen corresponding path program 1 times [2023-02-17 21:52:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:52:18,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14456022] [2023-02-17 21:52:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:52:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:52:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:52:18,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14456022] [2023-02-17 21:52:18,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 21:52:18,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457319343] [2023-02-17 21:52:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:18,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:52:18,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:18,251 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 21:52:18,254 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 21:52:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:52:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 21:52:18,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:52:18,358 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 21:52:18,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 21:52:18,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457319343] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 21:52:18,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 21:52:18,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 21:52:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964859734] [2023-02-17 21:52:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 21:52:18,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 21:52:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:52:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 21:52:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 21:52:18,361 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 21:52:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:52:18,422 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2023-02-17 21:52:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 21:52:18,422 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 21:52:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:52:18,423 INFO L225 Difference]: With dead ends: 69 [2023-02-17 21:52:18,424 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 21:52:18,424 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 21:52:18,425 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 21:52:18,426 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 21:52:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 21:52:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-02-17 21:52:18,431 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 21:52:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-02-17 21:52:18,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2023-02-17 21:52:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:52:18,432 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-02-17 21:52:18,432 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 21:52:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-02-17 21:52:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 21:52:18,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:52:18,433 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 21:52:18,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 21:52:18,639 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 21:52:18,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:52:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:52:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1890076394, now seen corresponding path program 1 times [2023-02-17 21:52:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:52:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475678120] [2023-02-17 21:52:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:52:18,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:52:18,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764397524] [2023-02-17 21:52:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:18,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:52:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:18,683 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 21:52:18,690 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 21:52:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 21:52:18,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-17 21:52:18,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:52:18,817 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 21:52:18,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:18,842 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 21:52:18,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:18,880 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 21:52:18,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:18,921 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 21:52:18,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:18,969 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 21:52:19,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:19,012 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 21:52:19,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:19,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:19,068 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 21:52:19,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:19,230 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 21:52:19,254 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 21:52:19,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:52:20,236 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:20,294 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 21:52:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:52:20,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475678120] [2023-02-17 21:52:20,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:52:20,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764397524] [2023-02-17 21:52:20,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764397524] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:52:20,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:52:20,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2023-02-17 21:52:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303562081] [2023-02-17 21:52:20,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:52:20,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 21:52:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:52:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 21:52:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 21:52:20,299 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 21:52:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:52:23,706 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2023-02-17 21:52:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 21:52:23,706 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 21:52:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:52:23,708 INFO L225 Difference]: With dead ends: 99 [2023-02-17 21:52:23,709 INFO L226 Difference]: Without dead ends: 97 [2023-02-17 21:52:23,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=511, Invalid=3271, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 21:52:23,711 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2023-02-17 21:52:23,712 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.7s Time] [2023-02-17 21:52:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-17 21:52:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2023-02-17 21:52:23,724 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 21:52:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-17 21:52:23,725 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 32 [2023-02-17 21:52:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:52:23,725 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-17 21:52:23,726 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 21:52:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-17 21:52:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 21:52:23,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:52:23,727 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 21:52:23,733 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 21:52:23,933 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 21:52:23,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:52:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:52:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1237633832, now seen corresponding path program 2 times [2023-02-17 21:52:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:52:23,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719807463] [2023-02-17 21:52:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:52:23,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:52:23,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348428307] [2023-02-17 21:52:23,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 21:52:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:52:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:23,966 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 21:52:23,989 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 21:52:24,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 21:52:24,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:52:24,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 21:52:24,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:52:24,079 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 21:52:24,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:52:24,097 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 21:52:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:52:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719807463] [2023-02-17 21:52:24,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:52:24,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348428307] [2023-02-17 21:52:24,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348428307] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:52:24,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:52:24,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-17 21:52:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299783608] [2023-02-17 21:52:24,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:52:24,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 21:52:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:52:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 21:52:24,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 21:52:24,112 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 21:52:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:52:24,309 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2023-02-17 21:52:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 21:52:24,312 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 21:52:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:52:24,313 INFO L225 Difference]: With dead ends: 156 [2023-02-17 21:52:24,313 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 21:52:24,314 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 21:52:24,314 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.2s IncrementalHoareTripleChecker+Time [2023-02-17 21:52:24,315 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.2s Time] [2023-02-17 21:52:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 21:52:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2023-02-17 21:52:24,324 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 21:52:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-02-17 21:52:24,325 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 34 [2023-02-17 21:52:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:52:24,325 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-02-17 21:52:24,325 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 21:52:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-02-17 21:52:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 21:52:24,326 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:52:24,326 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 21:52:24,335 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 21:52:24,533 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 21:52:24,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:52:24,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:52:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 999316006, now seen corresponding path program 3 times [2023-02-17 21:52:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:52:24,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346471312] [2023-02-17 21:52:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:52:24,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:52:24,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333707595] [2023-02-17 21:52:24,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 21:52:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:52:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:24,561 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 21:52:24,585 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 21:52:24,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 21:52:24,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:52:24,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 21:52:24,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:52:24,668 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 21:52:24,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:52:24,691 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 21:52:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:52:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346471312] [2023-02-17 21:52:24,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:52:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333707595] [2023-02-17 21:52:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333707595] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:52:24,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:52:24,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-17 21:52:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926748875] [2023-02-17 21:52:24,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:52:24,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 21:52:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:52:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 21:52:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 21:52:24,695 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 21:52:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 21:52:24,815 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-17 21:52:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 21:52:24,816 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 21:52:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 21:52:24,816 INFO L225 Difference]: With dead ends: 81 [2023-02-17 21:52:24,816 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 21:52:24,817 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 21:52:24,818 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 21:52:24,818 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 21:52:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 21:52:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2023-02-17 21:52:24,824 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 21:52:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-02-17 21:52:24,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2023-02-17 21:52:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 21:52:24,825 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-02-17 21:52:24,825 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 21:52:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-02-17 21:52:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 21:52:24,826 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 21:52:24,827 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 21:52:24,840 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 21:52:25,034 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 21:52:25,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 21:52:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 21:52:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 772187038, now seen corresponding path program 4 times [2023-02-17 21:52:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 21:52:25,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722093643] [2023-02-17 21:52:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 21:52:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 21:52:25,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 21:52:25,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015377485] [2023-02-17 21:52:25,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 21:52:25,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 21:52:25,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 21:52:25,065 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 21:52:25,068 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 21:52:25,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 21:52:25,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 21:52:25,190 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-17 21:52:25,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 21:52:25,207 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 21:52:25,210 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 21:52:25,215 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 21:52:25,229 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 21:52:25,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:25,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:25,281 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 21:52:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:25,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:25,311 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 21:52:25,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:25,380 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 21:52:25,420 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 21:52:25,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:25,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:25,477 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 21:52:25,532 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 21:52:25,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:25,594 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 21:52:25,658 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 21:52:25,735 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 21:52:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 21:52:25,737 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 21:52:25,838 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 21:52:25,931 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 21:52:25,965 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 21:52:25,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 21:52:45,248 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 21:52:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 21:52:45,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722093643] [2023-02-17 21:52:45,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 21:52:45,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015377485] [2023-02-17 21:52:45,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015377485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 21:52:45,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 21:52:45,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2023-02-17 21:52:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428755819] [2023-02-17 21:52:45,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 21:52:45,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-17 21:52:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 21:52:45,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-17 21:52:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3416, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 21:52:45,254 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 21:53:52,171 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 21:53:53,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:53:55,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:55:24,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:55:43,507 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse39 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (+ .cse51 (select .cse38 .cse39))) (.cse41 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse42 (+ 0 1)) (.cse17 (< .cse41 c_~N~0)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)))) (let ((.cse11 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ (* .cse41 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (< (+ .cse41 1) c_~N~0)) (.cse16 (not .cse17)) (.cse40 (+ .cse42 1)) (.cse14 (* (+ c_~N~0 2) c_~N~0)) (.cse5 (+ (* 8 .cse42) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 0)))) (and (or (= (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse11 .cse12) .cse13))))) (let ((.cse9 (store (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 0) .cse5 0))) (let ((.cse6 (+ (select (select (store .cse7 |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 ((.cse0 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (store .cse9 .cse3 .cse6))) (store .cse8 .cse5 (+ (select (select (store .cse7 |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 ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (let ((.cse4 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse6))) (+ .cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse2))))))) .cse14) .cse15 .cse16) (or .cse17 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse25 (store (store .cse11 .cse3 0) .cse5 0))) (let ((.cse22 (+ 0 (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse18 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse25 .cse3 .cse22))) (store .cse24 .cse5 (+ 0 (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (let ((.cse21 (+ (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse22))) (+ .cse21 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse20)))))) .cse14)) (forall ((~N~0 Int)) (or (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse31 (let ((.cse37 (store .cse38 .cse39 1))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse36 (+ (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse37 .cse3)))) (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse36))))))))) (let ((.cse33 (store (store (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 0) .cse5 0))) (let ((.cse30 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse27 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse32 (store .cse33 .cse3 .cse30))) (store .cse32 .cse5 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (let ((.cse29 (+ (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse30))) (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse29)))) (+ .cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))))) (< .cse40 ~N~0) (< .cse41 ~N~0) (not (< .cse42 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or (= .cse14 (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 (select .cse38 .cse12)))))) (let ((.cse50 (store (store (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 0) .cse5 0))) (let ((.cse47 (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse43 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (store .cse50 .cse3 .cse47))) (store .cse49 .cse5 (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (let ((.cse46 (+ .cse47 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse46)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse46)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse45)))))))) .cse15 .cse16) (or (< .cse40 c_~N~0) (not (< .cse42 c_~N~0)) (= .cse14 (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse60 (+ .cse51 (select .cse38 .cse3)))) (+ .cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) (let ((.cse59 (store (store (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 0) .cse5 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 .cse3 .cse56))) (store .cse58 .cse5 (+ (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|) .cse5) .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|) .cse3)))))))))))))))) is different from true [2023-02-17 21:56:41,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:56:49,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:56:52,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:56:54,232 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 21:56:56,238 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 21:56:57,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:00,004 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 21:57:02,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:04,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:06,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:07,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:15,401 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 21:57:16,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:18,920 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 21:57:21,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:22,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:24,787 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 21:57:25,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:27,956 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 21:57:29,961 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 21:57:31,966 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 21:57:34,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:36,425 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 21:57:38,432 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 21:57:39,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:57:41,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse82 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse42 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse92 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (+ .cse82 (select .cse42 .cse92))) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse19 (+ 0 1)) (.cse34 (< .cse1 c_~N~0)) (.cse2 (+ .cse1 1)) (.cse60 (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 .cse60 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (store .cse42 .cse92 1)) (.cse18 (+ (* .cse1 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (< .cse2 c_~N~0)) (.cse33 (not .cse34)) (.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) (or .cse34 (= .cse31 (let ((.cse41 (store (store .cse42 .cse6 0) .cse8 0))) (let ((.cse39 (+ (select (select (store |c_#memory_int| |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 |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (store .cse41 .cse6 .cse39))) (store .cse40 .cse8 (+ (select (select (store |c_#memory_int| |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|) 0)))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (let ((.cse38 (+ .cse39 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ .cse38 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (+ (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|) .cse6) .cse37)))))))) (forall ((~N~0 Int)) (or (< .cse0 ~N~0) (not (< .cse1 ~N~0)) (< .cse2 ~N~0) (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse48 (let ((.cse54 (store .cse42 .cse18 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse53 (+ (select .cse54 .cse6) (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse53)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse53))))))))) (let ((.cse50 (store (store (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse47 (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse44 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (store .cse50 .cse6 .cse47))) (store .cse49 .cse8 (+ 0 (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (let ((.cse46 (+ .cse47 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse46)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse46)))) (+ .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))))))) (not (< .cse19 ~N~0)))) (or .cse34 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse62 (store (store .cse29 .cse6 0) .cse8 0))) (let ((.cse59 (+ 0 (select (select (store .cse60 |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|)))) (let ((.cse55 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse61 (store .cse62 .cse6 .cse59))) (store .cse61 .cse8 (+ 0 (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (let ((.cse58 (+ (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse59))) (+ .cse58 (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse58)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (+ (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse57)))))) .cse31)) (forall ((~N~0 Int)) (or (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse68 (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse73 (+ (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse17 .cse6)))) (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse73)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse73)))))))) (let ((.cse70 (store (store (select .cse68 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse67 (+ (select (select (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse64 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse69 (store .cse70 .cse6 .cse67))) (store .cse69 .cse8 (+ (select (select (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| .cse69) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (let ((.cse66 (+ (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse67))) (+ (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)))) (+ .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse63)) |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 ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 (select .cse42 .cse18)))))) (let ((.cse81 (store (store (select .cse79 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse78 (+ (select (select (store .cse79 |c_ULTIMATE.start_main_~a~0#1.base| .cse81) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse74 (store .cse79 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse80 (store .cse81 .cse6 .cse78))) (store .cse80 .cse8 (+ (select (select (store .cse79 |c_ULTIMATE.start_main_~a~0#1.base| .cse80) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (let ((.cse77 (+ .cse78 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse77)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse77)))) (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse76)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse76)))))))) .cse32 .cse33) (or (< .cse0 c_~N~0) (not (< .cse19 c_~N~0)) .cse34 (= .cse31 (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse91 (+ .cse82 (select .cse42 .cse6)))) (+ .cse91 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse91)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))) (let ((.cse90 (store (store (select .cse88 |c_ULTIMATE.start_main_~a~0#1.base|) .cse6 0) .cse8 0))) (let ((.cse87 (+ 0 (select (select (store .cse88 |c_ULTIMATE.start_main_~a~0#1.base| .cse90) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse84 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse89 (store .cse90 .cse6 .cse87))) (store .cse89 .cse8 (+ (select (select (store .cse88 |c_ULTIMATE.start_main_~a~0#1.base| .cse89) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse83 (let ((.cse86 (+ (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse87))) (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse86)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse86)))) (+ .cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse83)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))))))))))))) is different from false [2023-02-17 21:58:04,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:58:08,811 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 21:58:11,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:58:14,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:58:18,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 21:58:19,853 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 21:58:26,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-17 22:00:22,262 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 22:00:24,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse52 (+ 0 1)) (.cse51 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse19 (+ (* .cse51 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (+ .cse52 1)) (.cse0 (< .cse51 c_~N~0)) (.cse1 (* (+ c_~N~0 2) c_~N~0)) (.cse7 (+ (* 8 .cse52) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 0)))) (and (or .cse0 (= .cse1 (let ((.cse10 (store (store .cse11 .cse5 0) .cse7 0))) (let ((.cse8 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (store .cse10 .cse5 .cse8))) (store .cse9 .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 ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (let ((.cse6 (+ .cse8 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ .cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4)))))))) (= (let ((.cse18 (store .cse11 .cse19 0))) (let ((.cse16 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse18 .cse5)))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (store .cse18 .cse5 .cse16))) (store .cse17 .cse7 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse18 .cse7))))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (let ((.cse15 (+ .cse16 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ .cse15 (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|) .cse7))))) (+ .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) .cse1) (= .cse1 (let ((.cse26 (store (store .cse11 .cse27 0) .cse19 0))) (let ((.cse24 (+ (select .cse26 .cse5) (select (select (store |c_#memory_int| |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|)))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (store .cse26 .cse5 .cse24))) (store .cse25 .cse7 (+ (select .cse26 .cse7) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (let ((.cse23 (+ .cse24 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse23)))) (+ .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (or .cse0 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 (select .cse11 .cse27)))))) (let ((.cse35 (store (store (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 0) .cse7 0))) (let ((.cse32 (+ 0 (select (select (store .cse33 |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 ((.cse28 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (store .cse35 .cse5 .cse32))) (store .cse34 .cse7 (+ 0 (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (let ((.cse31 (+ (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse32))) (+ .cse31 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse30)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse30))))))) .cse1)) (forall ((~N~0 Int)) (or (= (* ~N~0 (+ 2 ~N~0)) (let ((.cse43 (let ((.cse49 (store .cse11 .cse27 1))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49))) (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse48 (+ (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse49 .cse5)))) (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse48)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse48))))))))) (let ((.cse45 (store (store (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 0) .cse7 0))) (let ((.cse42 (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse39 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse44 (store .cse45 .cse5 .cse42))) (store .cse44 .cse7 (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (let ((.cse41 (+ (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse42))) (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse41)))) (+ .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))) (< .cse50 ~N~0) (< .cse51 ~N~0) (not (< .cse52 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or (< .cse50 c_~N~0) (not (< .cse52 c_~N~0)) .cse0 (= .cse1 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse61 (+ .cse37 (select .cse11 .cse5)))) (+ .cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse61)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (let ((.cse60 (store (store (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 0) .cse7 0))) (let ((.cse57 (+ 0 (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse54 (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse59 (store .cse60 .cse5 .cse57))) (store .cse59 .cse7 (+ (select (select (store .cse58 |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|) 0)))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (let ((.cse56 (+ (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse57))) (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse56)))) (+ .cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse53)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))))))) is different from false [2023-02-17 22:01:11,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 22:01:39,918 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 [] [2023-02-17 22:01:41,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-17 22:01:43,365 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 [] [2023-02-17 22:01:48,061 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 22:01:49,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 22:01:50,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 22:02:34,167 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 [] [2023-02-17 22:03:42,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 22:03:44,158 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 22:03:45,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 22:03:46,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 22:03:49,100 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 22:04:41,969 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 22:05:23,207 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-02-17 22:05:23,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-02-17 22:05:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-02-17 22:05:23,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 592.4s TimeCoverageRelationStatistics Valid=858, Invalid=6931, Unknown=59, NotChecked=708, Total=8556 [2023-02-17 22:05:23,210 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 115 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 156.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 157.5s IncrementalHoareTripleChecker+Time [2023-02-17 22:05:23,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 89 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 999 Invalid, 19 Unknown, 17 Unchecked, 157.5s Time] [2023-02-17 22:05:23,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 22:05:23,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:05:23,411 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2023-02-17 22:05:23,414 INFO L158 Benchmark]: Toolchain (without parser) took 786566.64ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 118.3MB in the beginning and 170.6MB in the end (delta: -52.2MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2023-02-17 22:05:23,415 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 22:05:23,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.56ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 106.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 22:05:23,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.57ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 105.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 22:05:23,415 INFO L158 Benchmark]: Boogie Preprocessor took 31.57ms. Allocated memory is still 161.5MB. Free memory was 105.2MB in the beginning and 103.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 22:05:23,416 INFO L158 Benchmark]: RCFGBuilder took 375.00ms. Allocated memory is still 161.5MB. Free memory was 103.8MB in the beginning and 91.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 22:05:23,416 INFO L158 Benchmark]: TraceAbstraction took 785902.64ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 132.9MB in the beginning and 170.6MB in the end (delta: -37.7MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. [2023-02-17 22:05:23,417 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.56ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 106.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.57ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 105.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.57ms. Allocated memory is still 161.5MB. Free memory was 105.2MB in the beginning and 103.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 375.00ms. Allocated memory is still 161.5MB. Free memory was 103.8MB in the beginning and 91.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 785902.64ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 132.9MB in the beginning and 170.6MB in the end (delta: -37.7MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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 22:05:25,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 22:05:25,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 22:05:25,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 22:05:25,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 22:05:25,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 22:05:25,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 22:05:25,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 22:05:25,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 22:05:25,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 22:05:25,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 22:05:25,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 22:05:25,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 22:05:25,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 22:05:25,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 22:05:25,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 22:05:25,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 22:05:25,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 22:05:25,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 22:05:25,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 22:05:25,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 22:05:25,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 22:05:25,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 22:05:25,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 22:05:25,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 22:05:25,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 22:05:25,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 22:05:25,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 22:05:25,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 22:05:25,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 22:05:25,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 22:05:25,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 22:05:25,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 22:05:25,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 22:05:25,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 22:05:25,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 22:05:25,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 22:05:25,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 22:05:25,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 22:05:25,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 22:05:25,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 22:05:25,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 22:05:25,302 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 22:05:25,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 22:05:25,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 22:05:25,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 22:05:25,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 22:05:25,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 22:05:25,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 22:05:25,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 22:05:25,305 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 22:05:25,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 22:05:25,306 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 22:05:25,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 22:05:25,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 22:05:25,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 22:05:25,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 22:05:25,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 22:05:25,307 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 22:05:25,307 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 22:05:25,307 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 22:05:25,307 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 22:05:25,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 22:05:25,308 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 22:05:25,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 22:05:25,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 22:05:25,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 22:05:25,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 22:05:25,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:05:25,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 22:05:25,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 22:05:25,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 22:05:25,309 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 22:05:25,309 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 22:05:25,310 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 22:05:25,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 22:05:25,310 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 22:05:25,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 22:05:25,310 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 22:05:25,310 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 22:05:25,311 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 22:05:25,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 22:05:25,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 22:05:25,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 22:05:25,616 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 22:05:25,617 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 22:05:25,618 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 22:05:26,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 22:05:26,942 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 22:05:26,943 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c [2023-02-17 22:05:26,949 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9621202/786332a2471e4b1b8430933430493d2d/FLAG354bc7698 [2023-02-17 22:05:26,971 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9621202/786332a2471e4b1b8430933430493d2d [2023-02-17 22:05:26,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 22:05:26,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 22:05:26,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 22:05:26,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 22:05:26,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 22:05:26,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:05:26" (1/1) ... [2023-02-17 22:05:26,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7aba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:26, skipping insertion in model container [2023-02-17 22:05:26,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:05:26" (1/1) ... [2023-02-17 22:05:26,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 22:05:27,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 22:05:27,148 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 22:05:27,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:05:27,192 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 22:05:27,210 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 22:05:27,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:05:27,239 INFO L208 MainTranslator]: Completed translation [2023-02-17 22:05:27,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27 WrapperNode [2023-02-17 22:05:27,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 22:05:27,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 22:05:27,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 22:05:27,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 22:05:27,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,273 INFO L138 Inliner]: procedures = 19, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2023-02-17 22:05:27,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 22:05:27,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 22:05:27,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 22:05:27,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 22:05:27,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 22:05:27,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 22:05:27,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 22:05:27,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 22:05:27,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (1/1) ... [2023-02-17 22:05:27,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:05:27,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:05:27,337 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 22:05:27,355 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 22:05:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 22:05:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 22:05:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 22:05:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2023-02-17 22:05:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 22:05:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 22:05:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 22:05:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-02-17 22:05:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 22:05:27,445 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 22:05:27,447 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 22:05:27,720 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 22:05:27,725 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 22:05:27,755 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-17 22:05:27,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:05:27 BoogieIcfgContainer [2023-02-17 22:05:27,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 22:05:27,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 22:05:27,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 22:05:27,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 22:05:27,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 10:05:26" (1/3) ... [2023-02-17 22:05:27,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296ab84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:05:27, skipping insertion in model container [2023-02-17 22:05:27,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:05:27" (2/3) ... [2023-02-17 22:05:27,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296ab84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:05:27, skipping insertion in model container [2023-02-17 22:05:27,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:05:27" (3/3) ... [2023-02-17 22:05:27,789 INFO L112 eAbstractionObserver]: Analyzing ICFG ss2.c [2023-02-17 22:05:27,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 22:05:27,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 22:05:27,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 22:05:27,858 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;@b9a4988, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 22:05:27,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 22:05:27,864 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 22:05:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 22:05:27,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:05:27,870 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 22:05:27,870 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:05:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:05:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -642180410, now seen corresponding path program 1 times [2023-02-17 22:05:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:05:27,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926325486] [2023-02-17 22:05:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:05:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 22:05:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:05:27,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 22:05:27,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 22:05:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:05:28,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 22:05:28,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:05:28,060 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 22:05:28,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 22:05:28,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:05:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926325486] [2023-02-17 22:05:28,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926325486] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 22:05:28,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 22:05:28,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 22:05:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547242610] [2023-02-17 22:05:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 22:05:28,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 22:05:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:05:28,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 22:05:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 22:05:28,099 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 22:05:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:05:28,121 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2023-02-17 22:05:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 22:05:28,124 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 22:05:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:05:28,130 INFO L225 Difference]: With dead ends: 62 [2023-02-17 22:05:28,131 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 22:05:28,133 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 22:05:28,136 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 22:05:28,137 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 22:05:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 22:05:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 22:05:28,167 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 22:05:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-17 22:05:28,169 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2023-02-17 22:05:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:05:28,169 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-17 22:05:28,170 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 22:05:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-17 22:05:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 22:05:28,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:05:28,171 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 22:05:28,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 22:05:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 22:05:28,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:05:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:05:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1011332042, now seen corresponding path program 1 times [2023-02-17 22:05:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:05:28,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523946409] [2023-02-17 22:05:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:05:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 22:05:28,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:05:28,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 22:05:28,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 22:05:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:05:28,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 22:05:28,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:05:28,575 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 22:05:28,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 22:05:28,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:05:28,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523946409] [2023-02-17 22:05:28,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523946409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 22:05:28,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 22:05:28,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 22:05:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213495173] [2023-02-17 22:05:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 22:05:28,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 22:05:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:05:28,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 22:05:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 22:05:28,579 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 22:05:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:05:28,816 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2023-02-17 22:05:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 22:05:28,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 22:05:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:05:28,822 INFO L225 Difference]: With dead ends: 69 [2023-02-17 22:05:28,822 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 22:05:28,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 22:05:28,824 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 109 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 22:05:28,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 17 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 22:05:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 22:05:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-02-17 22:05:28,840 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 22:05:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-02-17 22:05:28,841 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2023-02-17 22:05:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:05:28,842 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-02-17 22:05:28,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 22:05:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-02-17 22:05:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 22:05:28,843 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:05:28,843 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 22:05:28,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 22:05:29,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 22:05:29,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:05:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:05:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1890076394, now seen corresponding path program 1 times [2023-02-17 22:05:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:05:29,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532699834] [2023-02-17 22:05:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:05:29,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 22:05:29,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:05:29,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 22:05:29,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 22:05:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:05:29,253 WARN L261 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 22:05:29,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:05:29,311 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 22:05:29,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,322 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 22:05:29,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-02-17 22:05:29,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2023-02-17 22:05:29,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 71 [2023-02-17 22:05:29,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,609 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 22:05:29,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2023-02-17 22:05:29,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 91 [2023-02-17 22:05:29,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:05:29,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 91 [2023-02-17 22:05:29,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 129 [2023-02-17 22:05:30,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 249 [2023-02-17 22:05:30,132 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 22:05:30,132 INFO L328 TraceCheckSpWp]: Computing backward predicates...