./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/nsqm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/nsqm.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 b64d5f0150faeb5d8c80a790953ff0d0f860fa8f91611b25d82154854354bbd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:05:59,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:05:59,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:05:59,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:05:59,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:05:59,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:05:59,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:05:59,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:05:59,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:05:59,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:05:59,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:05:59,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:05:59,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:05:59,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:05:59,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:05:59,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:05:59,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:05:59,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:05:59,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:05:59,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:05:59,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:05:59,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:05:59,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:05:59,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:05:59,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:05:59,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:05:59,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:05:59,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:05:59,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:05:59,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:05:59,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:05:59,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:05:59,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:05:59,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:05:59,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:05:59,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:05:59,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:05:59,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:05:59,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:05:59,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:05:59,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:05:59,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:05:59,526 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:05:59,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:05:59,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:05:59,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:05:59,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:05:59,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:05:59,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:05:59,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:05:59,529 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:05:59,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:05:59,529 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:05:59,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:05:59,531 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:05:59,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:05:59,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:05:59,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:05:59,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:05:59,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:05:59,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:05:59,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:05:59,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:05:59,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:05:59,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:05:59,532 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:05:59,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:05:59,533 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:05:59,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:05:59,533 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:05:59,533 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 -> b64d5f0150faeb5d8c80a790953ff0d0f860fa8f91611b25d82154854354bbd0 [2023-02-15 19:05:59,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:05:59,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:05:59,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:05:59,773 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:05:59,773 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:05:59,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/nsqm.c [2023-02-15 19:06:00,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:06:00,911 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:06:00,912 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/nsqm.c [2023-02-15 19:06:00,917 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ec6a427/d3e74d80ea494b4e8504dab1c2058e14/FLAGbb3950d3e [2023-02-15 19:06:00,933 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ec6a427/d3e74d80ea494b4e8504dab1c2058e14 [2023-02-15 19:06:00,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:06:00,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:06:00,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:06:00,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:06:00,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:06:00,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:06:00" (1/1) ... [2023-02-15 19:06:00,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612b7a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:00, skipping insertion in model container [2023-02-15 19:06:00,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:06:00" (1/1) ... [2023-02-15 19:06:00,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:06:00,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:06:01,040 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/nsqm.c[587,600] [2023-02-15 19:06:01,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:06:01,056 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:06:01,063 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/nsqm.c[587,600] [2023-02-15 19:06:01,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:06:01,076 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:06:01,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01 WrapperNode [2023-02-15 19:06:01,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:06:01,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:06:01,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:06:01,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:06:01,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,097 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-15 19:06:01,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:06:01,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:06:01,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:06:01,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:06:01,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:06:01,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:06:01,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:06:01,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:06:01,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (1/1) ... [2023-02-15 19:06:01,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:06:01,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:01,135 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-15 19:06:01,140 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-15 19:06:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:06:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:06:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:06:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:06:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:06:01,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:06:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:06:01,203 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:06:01,205 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:06:01,365 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:06:01,369 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:06:01,369 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 19:06:01,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:06:01 BoogieIcfgContainer [2023-02-15 19:06:01,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:06:01,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:06:01,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:06:01,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:06:01,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:06:00" (1/3) ... [2023-02-15 19:06:01,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602c930e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:06:01, skipping insertion in model container [2023-02-15 19:06:01,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:06:01" (2/3) ... [2023-02-15 19:06:01,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602c930e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:06:01, skipping insertion in model container [2023-02-15 19:06:01,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:06:01" (3/3) ... [2023-02-15 19:06:01,376 INFO L112 eAbstractionObserver]: Analyzing ICFG nsqm.c [2023-02-15 19:06:01,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:06:01,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:06:01,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:06:01,464 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;@93aa4b0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:06:01,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:06:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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-15 19:06:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 19:06:01,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:01,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:01,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:01,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2023-02-15 19:06:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:01,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070141746] [2023-02-15 19:06:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:01,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070141746] [2023-02-15 19:06:01,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 19:06:01,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755367574] [2023-02-15 19:06:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:01,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:01,607 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-15 19:06:01,608 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-15 19:06:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:01,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 19:06:01,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:01,704 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-15 19:06:01,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:06:01,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755367574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:06:01,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:06:01,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:06:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119734209] [2023-02-15 19:06:01,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:06:01,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:06:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:06:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:06:01,729 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 19:06:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:01,739 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2023-02-15 19:06:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:06:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-02-15 19:06:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:01,745 INFO L225 Difference]: With dead ends: 38 [2023-02-15 19:06:01,745 INFO L226 Difference]: Without dead ends: 17 [2023-02-15 19:06:01,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:06:01,749 INFO L413 NwaCegarLoop]: 24 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, 24 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-15 19:06:01,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:06:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-15 19:06:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-15 19:06:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-15 19:06:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-15 19:06:01,771 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2023-02-15 19:06:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:01,771 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-15 19:06:01,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 19:06:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-15 19:06:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 19:06:01,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:01,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:01,780 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-15 19:06:01,978 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-15 19:06:01,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2023-02-15 19:06:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934315776] [2023-02-15 19:06:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:02,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:02,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167586855] [2023-02-15 19:06:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:02,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:02,015 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-15 19:06:02,017 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-15 19:06:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:02,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:06:02,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:02,158 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2023-02-15 19:06:02,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2023-02-15 19:06:02,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:02,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:02,242 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 7 treesize of output 5 [2023-02-15 19:06:02,304 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-15 19:06:02,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:06:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934315776] [2023-02-15 19:06:02,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167586855] [2023-02-15 19:06:02,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167586855] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:06:02,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:06:02,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:06:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625887681] [2023-02-15 19:06:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:06:02,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:06:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:06:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:06:02,308 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-15 19:06:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:02,447 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-02-15 19:06:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:06:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2023-02-15 19:06:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:02,448 INFO L225 Difference]: With dead ends: 34 [2023-02-15 19:06:02,449 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 19:06:02,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:06:02,450 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:02,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 42 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:06:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 19:06:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2023-02-15 19:06:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-15 19:06:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 19:06:02,455 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2023-02-15 19:06:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:02,455 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 19:06:02,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-15 19:06:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 19:06:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 19:06:02,456 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:02,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:02,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:06:02,661 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-15 19:06:02,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2023-02-15 19:06:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940106527] [2023-02-15 19:06:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:02,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:02,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556448172] [2023-02-15 19:06:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:02,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:02,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:02,691 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-15 19:06:02,693 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-15 19:06:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:02,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:06:02,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:02,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:06:02,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940106527] [2023-02-15 19:06:02,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556448172] [2023-02-15 19:06:02,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556448172] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:06:02,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:06:02,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:06:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582193036] [2023-02-15 19:06:02,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:06:02,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:06:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:06:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:06:02,779 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-15 19:06:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:02,843 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-02-15 19:06:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:06:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-02-15 19:06:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:02,845 INFO L225 Difference]: With dead ends: 49 [2023-02-15 19:06:02,846 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 19:06:02,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-15 19:06:02,847 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:02,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 30 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:06:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 19:06:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2023-02-15 19:06:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-15 19:06:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-15 19:06:02,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2023-02-15 19:06:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:02,856 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-15 19:06:02,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-15 19:06:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-15 19:06:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 19:06:02,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:02,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:02,864 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-15 19:06:03,064 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-15 19:06:03,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:03,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2023-02-15 19:06:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:03,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530932268] [2023-02-15 19:06:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:03,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:03,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872544253] [2023-02-15 19:06:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:03,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:03,092 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-15 19:06:03,094 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-15 19:06:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:03,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:06:03,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:03,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530932268] [2023-02-15 19:06:03,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:03,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872544253] [2023-02-15 19:06:03,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872544253] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:03,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:03,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-15 19:06:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680994039] [2023-02-15 19:06:03,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:03,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:06:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:06:03,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:06:03,205 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-15 19:06:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:03,267 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-02-15 19:06:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:06:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 14 [2023-02-15 19:06:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:03,268 INFO L225 Difference]: With dead ends: 44 [2023-02-15 19:06:03,268 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 19:06:03,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:06:03,269 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:03,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:06:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 19:06:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2023-02-15 19:06:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-15 19:06:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 19:06:03,273 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2023-02-15 19:06:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:03,273 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 19:06:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-15 19:06:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 19:06:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:06:03,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:03,274 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:03,281 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-15 19:06:03,481 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-15 19:06:03,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2023-02-15 19:06:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:03,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15296312] [2023-02-15 19:06:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:03,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:03,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521612590] [2023-02-15 19:06:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:03,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:03,493 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-15 19:06:03,495 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-15 19:06:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:03,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:06:03,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:03,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:06:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15296312] [2023-02-15 19:06:03,578 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521612590] [2023-02-15 19:06:03,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521612590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:06:03,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:06:03,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:06:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311610664] [2023-02-15 19:06:03,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:06:03,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:06:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:06:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:06:03,581 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-15 19:06:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:03,628 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-02-15 19:06:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 19:06:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2023-02-15 19:06:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:03,629 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:06:03,629 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 19:06:03,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:06:03,631 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:03,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:06:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 19:06:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2023-02-15 19:06:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 19:06:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-02-15 19:06:03,637 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2023-02-15 19:06:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:03,637 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-02-15 19:06:03,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-15 19:06:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-02-15 19:06:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:06:03,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:03,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:03,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 19:06:03,845 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-15 19:06:03,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2023-02-15 19:06:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:03,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491218608] [2023-02-15 19:06:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:03,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:03,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081860478] [2023-02-15 19:06:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:03,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:03,869 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-15 19:06:03,871 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-15 19:06:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:03,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 19:06:03,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:03,976 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-15 19:06:03,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:03,983 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 16 treesize of output 16 [2023-02-15 19:06:03,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:04,022 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 16 treesize of output 18 [2023-02-15 19:06:04,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:04,086 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-15 19:06:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:04,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:04,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:06:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:04,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491218608] [2023-02-15 19:06:04,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:04,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081860478] [2023-02-15 19:06:04,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081860478] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:04,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:04,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-15 19:06:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169626486] [2023-02-15 19:06:04,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:04,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:06:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:06:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=138, Unknown=3, NotChecked=0, Total=182 [2023-02-15 19:06:04,288 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-15 19:06:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:04,757 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-02-15 19:06:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 19:06:04,758 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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 16 [2023-02-15 19:06:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:04,758 INFO L225 Difference]: With dead ends: 54 [2023-02-15 19:06:04,758 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 19:06:04,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=419, Unknown=3, NotChecked=0, Total=600 [2023-02-15 19:06:04,759 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 157 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:04,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 61 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:06:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 19:06:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 26. [2023-02-15 19:06:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-15 19:06:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-02-15 19:06:04,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2023-02-15 19:06:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:04,763 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-02-15 19:06:04,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-15 19:06:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-02-15 19:06:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 19:06:04,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:04,764 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:04,771 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-15 19:06:04,969 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-15 19:06:04,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2023-02-15 19:06:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:04,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917104223] [2023-02-15 19:06:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:04,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:04,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054996750] [2023-02-15 19:06:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:04,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:04,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:04,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:04,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:06:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:06:05,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 19:06:05,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:05,073 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-15 19:06:05,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:05,080 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 19:06:05,083 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 22 treesize of output 22 [2023-02-15 19:06:05,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 19:06:05,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:05,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:05,115 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 30 treesize of output 32 [2023-02-15 19:06:05,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:05,169 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 41 treesize of output 35 [2023-02-15 19:06:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:05,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:05,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:05,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917104223] [2023-02-15 19:06:05,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:05,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054996750] [2023-02-15 19:06:05,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054996750] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:05,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:05,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-02-15 19:06:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006916298] [2023-02-15 19:06:05,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:05,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 19:06:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:05,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 19:06:05,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:06:05,763 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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-15 19:06:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:07,791 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2023-02-15 19:06:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 19:06:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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) Word has length 20 [2023-02-15 19:06:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:07,792 INFO L225 Difference]: With dead ends: 82 [2023-02-15 19:06:07,792 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 19:06:07,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 19:06:07,793 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:07,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 98 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:06:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 19:06:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2023-02-15 19:06:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 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-15 19:06:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-02-15 19:06:07,801 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 20 [2023-02-15 19:06:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:07,801 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-02-15 19:06:07,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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-15 19:06:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-02-15 19:06:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 19:06:07,802 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:07,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:07,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 19:06:08,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:08,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1334592554, now seen corresponding path program 2 times [2023-02-15 19:06:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:08,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387258566] [2023-02-15 19:06:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:08,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:08,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106943669] [2023-02-15 19:06:08,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:06:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:08,023 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:08,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 19:06:08,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:06:08,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:06:08,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:06:08,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:06:08,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:06:08,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:08,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387258566] [2023-02-15 19:06:08,127 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:08,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106943669] [2023-02-15 19:06:08,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106943669] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:08,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:08,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 19:06:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545594733] [2023-02-15 19:06:08,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:08,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:06:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:08,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:06:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:06:08,128 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-15 19:06:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:08,218 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2023-02-15 19:06:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:06:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-15 19:06:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:08,219 INFO L225 Difference]: With dead ends: 103 [2023-02-15 19:06:08,219 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 19:06:08,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:06:08,220 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:08,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 45 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:06:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 19:06:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2023-02-15 19:06:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 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-15 19:06:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2023-02-15 19:06:08,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 20 [2023-02-15 19:06:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:08,228 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2023-02-15 19:06:08,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-15 19:06:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2023-02-15 19:06:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 19:06:08,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:08,229 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:08,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 19:06:08,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 19:06:08,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1146782124, now seen corresponding path program 3 times [2023-02-15 19:06:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:08,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916047052] [2023-02-15 19:06:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:08,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:08,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615168326] [2023-02-15 19:06:08,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:06:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:08,464 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:08,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 19:06:08,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:06:08,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:06:08,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:06:08,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:08,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:08,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916047052] [2023-02-15 19:06:08,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:08,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615168326] [2023-02-15 19:06:08,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615168326] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:08,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:08,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-15 19:06:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672126458] [2023-02-15 19:06:08,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:08,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:06:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:06:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:06:08,688 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-15 19:06:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:08,895 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-15 19:06:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:06:08,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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 22 [2023-02-15 19:06:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:08,896 INFO L225 Difference]: With dead ends: 113 [2023-02-15 19:06:08,896 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 19:06:08,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2023-02-15 19:06:08,897 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 120 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:08,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 79 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:06:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 19:06:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2023-02-15 19:06:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 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-15 19:06:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-02-15 19:06:08,906 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 22 [2023-02-15 19:06:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:08,906 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-02-15 19:06:08,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-15 19:06:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-02-15 19:06:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:06:08,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:08,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:08,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:06:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:09,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1083970380, now seen corresponding path program 2 times [2023-02-15 19:06:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:09,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388293222] [2023-02-15 19:06:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:09,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:09,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810758420] [2023-02-15 19:06:09,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:06:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:09,129 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:09,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 19:06:09,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:06:09,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:06:09,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:06:09,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:06:09,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:06:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:09,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388293222] [2023-02-15 19:06:09,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:09,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810758420] [2023-02-15 19:06:09,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810758420] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:09,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:09,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 19:06:09,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408081561] [2023-02-15 19:06:09,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:06:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:06:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:06:09,242 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-15 19:06:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:09,336 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-02-15 19:06:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:06:09,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 24 [2023-02-15 19:06:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:09,338 INFO L225 Difference]: With dead ends: 64 [2023-02-15 19:06:09,338 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 19:06:09,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-02-15 19:06:09,339 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:09,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 40 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:06:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 19:06:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2023-02-15 19:06:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 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-15 19:06:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-02-15 19:06:09,348 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2023-02-15 19:06:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:09,348 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-02-15 19:06:09,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-15 19:06:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-02-15 19:06:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:06:09,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:09,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:09,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-15 19:06:09,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 19:06:09,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 4 times [2023-02-15 19:06:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511284952] [2023-02-15 19:06:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:09,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:09,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220202326] [2023-02-15 19:06:09,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:06:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:09,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:09,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 19:06:09,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:06:09,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:06:09,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 19:06:09,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:09,867 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2023-02-15 19:06:09,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2023-02-15 19:06:09,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:09,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:09,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:06:09,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2023-02-15 19:06:09,916 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 7 treesize of output 5 [2023-02-15 19:06:09,920 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-15 19:06:09,925 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~N~0 1))) (let ((.cse1 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0))) (or (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select v_DerPreprocessor_3 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0))) (not .cse1) .cse2) (and .cse1 .cse2)))) (= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from true [2023-02-15 19:06:09,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:09,933 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 21 treesize of output 21 [2023-02-15 19:06:09,934 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 7 treesize of output 5 [2023-02-15 19:06:09,956 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 16 treesize of output 18 [2023-02-15 19:06:09,972 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 16 treesize of output 18 [2023-02-15 19:06:09,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-02-15 19:06:09,999 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 19:06:09,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 97 [2023-02-15 19:06:10,025 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-02-15 19:06:10,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 26 [2023-02-15 19:06:10,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-02-15 19:06:10,050 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 19:06:10,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 97 [2023-02-15 19:06:10,069 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-02-15 19:06:10,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 26 [2023-02-15 19:06:10,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 19:06:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 19:06:10,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:10,550 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) is different from false [2023-02-15 19:06:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-02-15 19:06:10,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:10,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511284952] [2023-02-15 19:06:10,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:10,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220202326] [2023-02-15 19:06:10,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220202326] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:10,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:10,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-15 19:06:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198810477] [2023-02-15 19:06:10,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:10,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 19:06:10,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 19:06:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=223, Unknown=2, NotChecked=66, Total=380 [2023-02-15 19:06:10,576 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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-15 19:06:10,594 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~N~0 1))) (let ((.cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0))) (and (let ((.cse1 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select v_DerPreprocessor_3 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0))) (not .cse1) .cse2) (and .cse1 .cse2))) (= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0)) .cse2))) is different from true [2023-02-15 19:06:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:13,307 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2023-02-15 19:06:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:06:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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 24 [2023-02-15 19:06:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:13,310 INFO L225 Difference]: With dead ends: 105 [2023-02-15 19:06:13,310 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 19:06:13,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=285, Invalid=776, Unknown=7, NotChecked=192, Total=1260 [2023-02-15 19:06:13,311 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 174 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:13,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 115 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 7 Unknown, 85 Unchecked, 0.3s Time] [2023-02-15 19:06:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 19:06:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 49. [2023-02-15 19:06:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 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-15 19:06:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-02-15 19:06:13,325 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2023-02-15 19:06:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:13,326 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-02-15 19:06:13,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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-15 19:06:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-02-15 19:06:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:06:13,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:13,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:13,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 19:06:13,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 19:06:13,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 149788298, now seen corresponding path program 3 times [2023-02-15 19:06:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:13,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123003587] [2023-02-15 19:06:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:13,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:13,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051181773] [2023-02-15 19:06:13,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:06:13,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:13,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:13,567 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:13,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 19:06:13,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:06:13,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:06:13,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:06:13,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:06:13,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:06:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:13,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123003587] [2023-02-15 19:06:13,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:13,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051181773] [2023-02-15 19:06:13,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051181773] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:13,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:13,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-15 19:06:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346560702] [2023-02-15 19:06:13,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:13,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:06:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:06:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:06:13,815 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-15 19:06:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:06:13,982 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2023-02-15 19:06:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:06:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 26 [2023-02-15 19:06:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:06:13,983 INFO L225 Difference]: With dead ends: 84 [2023-02-15 19:06:13,983 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 19:06:13,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:06:13,984 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:06:13,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 88 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:06:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 19:06:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2023-02-15 19:06:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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-15 19:06:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-02-15 19:06:13,991 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2023-02-15 19:06:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:06:13,991 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-02-15 19:06:13,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-15 19:06:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-02-15 19:06:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:06:13,991 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:06:13,991 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:06:13,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 19:06:14,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 19:06:14,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:06:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:06:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash -55017726, now seen corresponding path program 4 times [2023-02-15 19:06:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:06:14,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144354136] [2023-02-15 19:06:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:06:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:06:14,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:06:14,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467210327] [2023-02-15 19:06:14,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:06:14,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:06:14,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:06:14,208 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:06:14,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 19:06:14,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:06:14,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:06:14,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 19:06:14,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:06:14,451 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-02-15 19:06:14,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2023-02-15 19:06:14,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-02-15 19:06:14,474 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2023-02-15 19:06:14,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 70 [2023-02-15 19:06:14,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:06:14,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 19:06:14,522 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 25 treesize of output 18 [2023-02-15 19:06:14,524 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 7 treesize of output 5 [2023-02-15 19:06:14,534 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-15 19:06:14,575 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 119 treesize of output 111 [2023-02-15 19:06:14,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:06:14,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2023-02-15 19:06:14,590 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:06:14,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-02-15 19:06:14,747 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 155 treesize of output 141 [2023-02-15 19:06:14,754 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:06:14,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 201 [2023-02-15 19:06:14,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 62 [2023-02-15 19:06:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:06:14,885 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:06:14,887 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-02-15 19:06:14,887 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 6 case distinctions, treesize of input 77 treesize of output 61 [2023-02-15 19:06:15,176 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-02-15 19:06:15,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 46 [2023-02-15 19:06:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:15,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:06:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:06:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:06:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144354136] [2023-02-15 19:06:24,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:06:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467210327] [2023-02-15 19:06:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467210327] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:06:24,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:06:24,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-02-15 19:06:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563859908] [2023-02-15 19:06:24,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:06:24,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 19:06:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:06:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 19:06:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2023-02-15 19:06:24,074 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 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-15 19:06:47,361 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 257 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:07:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:07:00,687 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2023-02-15 19:07:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-15 19:07:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 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 28 [2023-02-15 19:07:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:07:00,688 INFO L225 Difference]: With dead ends: 128 [2023-02-15 19:07:00,689 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 19:07:00,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=566, Invalid=2626, Unknown=0, NotChecked=0, Total=3192 [2023-02-15 19:07:00,690 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:07:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 163 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 400 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2023-02-15 19:07:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 19:07:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 78. [2023-02-15 19:07:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 77 states have internal predecessors, (92), 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-15 19:07:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-02-15 19:07:00,708 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 28 [2023-02-15 19:07:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:07:00,709 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-02-15 19:07:00,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 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-15 19:07:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-02-15 19:07:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:07:00,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:07:00,710 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:07:00,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 19:07:00,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 19:07:00,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:07:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:07:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash -412561416, now seen corresponding path program 5 times [2023-02-15 19:07:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:07:00,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061939747] [2023-02-15 19:07:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:07:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:07:00,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:07:00,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499451059] [2023-02-15 19:07:00,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 19:07:00,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:07:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:07:00,937 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:07:00,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 19:07:06,128 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 19:07:06,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:07:06,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 19:07:06,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:07:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:07:06,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:07:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:07:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:07:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061939747] [2023-02-15 19:07:06,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:07:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499451059] [2023-02-15 19:07:06,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499451059] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:07:06,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:07:06,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-02-15 19:07:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051462207] [2023-02-15 19:07:06,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:07:06,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:07:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:07:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:07:06,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:07:06,278 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-15 19:07:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:07:06,430 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2023-02-15 19:07:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 19:07:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-15 19:07:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:07:06,431 INFO L225 Difference]: With dead ends: 118 [2023-02-15 19:07:06,431 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 19:07:06,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-02-15 19:07:06,432 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:07:06,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 79 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:07:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 19:07:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2023-02-15 19:07:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 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-15 19:07:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2023-02-15 19:07:06,446 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 32 [2023-02-15 19:07:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:07:06,446 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2023-02-15 19:07:06,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-15 19:07:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2023-02-15 19:07:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:07:06,447 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:07:06,447 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:07:06,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 19:07:06,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:07:06,655 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:07:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:07:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1680698556, now seen corresponding path program 6 times [2023-02-15 19:07:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:07:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861424929] [2023-02-15 19:07:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:07:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:07:06,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:07:06,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102165857] [2023-02-15 19:07:06,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 19:07:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:07:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:07:06,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:07:06,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 19:07:07,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-15 19:07:07,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:07:07,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 19:07:07,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:07:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:07:07,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:07:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:07:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:07:07,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861424929] [2023-02-15 19:07:07,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:07:07,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102165857] [2023-02-15 19:07:07,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102165857] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:07:07,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:07:07,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-02-15 19:07:07,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842282851] [2023-02-15 19:07:07,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:07:07,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 19:07:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:07:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 19:07:07,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 19:07:07,459 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-15 19:07:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:07:07,642 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2023-02-15 19:07:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:07:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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 32 [2023-02-15 19:07:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:07:07,643 INFO L225 Difference]: With dead ends: 169 [2023-02-15 19:07:07,644 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 19:07:07,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2023-02-15 19:07:07,646 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:07:07,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 65 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:07:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 19:07:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2023-02-15 19:07:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 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-15 19:07:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-02-15 19:07:07,665 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 32 [2023-02-15 19:07:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:07:07,665 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-02-15 19:07:07,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-15 19:07:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-02-15 19:07:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:07:07,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:07:07,666 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:07:07,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 19:07:07,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 19:07:07,873 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:07:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:07:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1021371332, now seen corresponding path program 7 times [2023-02-15 19:07:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:07:07,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843478621] [2023-02-15 19:07:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:07:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:07:07,890 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:07:07,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121284838] [2023-02-15 19:07:07,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 19:07:07,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:07:07,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:07:07,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:07:07,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 19:07:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:07:07,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 19:07:07,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:07:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:07:08,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:07:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:07:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:07:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843478621] [2023-02-15 19:07:08,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:07:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121284838] [2023-02-15 19:07:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121284838] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:07:08,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:07:08,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2023-02-15 19:07:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652593042] [2023-02-15 19:07:08,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:07:08,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 19:07:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:07:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 19:07:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-02-15 19:07:08,128 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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-15 19:07:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:07:08,626 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2023-02-15 19:07:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 19:07:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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-15 19:07:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:07:08,627 INFO L225 Difference]: With dead ends: 169 [2023-02-15 19:07:08,627 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 19:07:08,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 19:07:08,628 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 145 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:07:08,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 265 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:07:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 19:07:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 80. [2023-02-15 19:07:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 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-15 19:07:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-02-15 19:07:08,642 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 32 [2023-02-15 19:07:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:07:08,642 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-02-15 19:07:08,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 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-15 19:07:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-02-15 19:07:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 19:07:08,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:07:08,643 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:07:08,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 19:07:08,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 19:07:08,847 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:07:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:07:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 351176898, now seen corresponding path program 8 times [2023-02-15 19:07:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:07:08,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425260655] [2023-02-15 19:07:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:07:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:07:08,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:07:08,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251582309] [2023-02-15 19:07:08,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:07:08,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:07:08,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:07:08,861 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:07:08,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 19:07:08,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:07:08,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:07:08,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 19:07:08,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:07:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:07:09,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:07:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:07:09,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:07:09,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425260655] [2023-02-15 19:07:09,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:07:09,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251582309] [2023-02-15 19:07:09,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251582309] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:07:09,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:07:09,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-02-15 19:07:09,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250229837] [2023-02-15 19:07:09,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:07:09,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 19:07:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:07:09,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 19:07:09,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-15 19:07:09,091 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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-15 19:07:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:07:09,465 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2023-02-15 19:07:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 19:07:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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-15 19:07:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:07:09,466 INFO L225 Difference]: With dead ends: 155 [2023-02-15 19:07:09,466 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 19:07:09,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1052, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 19:07:09,467 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 224 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:07:09,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 127 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:07:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 19:07:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2023-02-15 19:07:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 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-15 19:07:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 19:07:09,483 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 34 [2023-02-15 19:07:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:07:09,484 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 19:07:09,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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-15 19:07:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 19:07:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:07:09,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:07:09,485 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:07:09,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 19:07:09,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 19:07:09,690 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:07:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:07:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -831401164, now seen corresponding path program 9 times [2023-02-15 19:07:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:07:09,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231816100] [2023-02-15 19:07:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:07:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:07:09,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:07:09,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767093055] [2023-02-15 19:07:09,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:07:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:07:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:07:09,706 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:07:09,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 19:07:10,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:07:10,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:07:10,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-15 19:07:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:07:10,407 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-02-15 19:07:10,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2023-02-15 19:07:10,426 INFO L321 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2023-02-15 19:07:10,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 75 [2023-02-15 19:07:10,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:07:10,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-02-15 19:07:10,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 19:07:10,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 68 [2023-02-15 19:07:10,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:07:10,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-02-15 19:07:10,495 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 5 treesize of output 3 [2023-02-15 19:07:10,511 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:07:10,555 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-15 19:07:10,633 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:07:10,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 126 [2023-02-15 19:07:10,640 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:07:10,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 187 [2023-02-15 19:07:10,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-15 19:07:10,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,799 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:07:10,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2023-02-15 19:07:10,880 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:07:10,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 86 [2023-02-15 19:07:10,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,897 INFO L321 Elim1Store]: treesize reduction 89, result has 1.1 percent of original size [2023-02-15 19:07:10,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 117 [2023-02-15 19:07:10,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:10,964 INFO L321 Elim1Store]: treesize reduction 82, result has 37.9 percent of original size [2023-02-15 19:07:10,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 74 [2023-02-15 19:07:11,444 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:07:11,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 193 [2023-02-15 19:07:11,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:07:11,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 201 [2023-02-15 19:07:11,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 124 [2023-02-15 19:07:11,726 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:07:11,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 231 treesize of output 205 [2023-02-15 19:07:11,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:07:11,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:11,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 221 [2023-02-15 19:07:12,114 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:07:12,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 373 treesize of output 335 [2023-02-15 19:07:12,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 260 [2023-02-15 19:07:12,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:07:12,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 165 [2023-02-15 19:07:13,032 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-15 19:07:13,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 175 treesize of output 71 [2023-02-15 19:07:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:07:13,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:07:38,410 WARN L859 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (< 4 c_~N~0) (let ((.cse69 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse70 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse17 (<= .cse70 2147483647)) (.cse68 (* .cse70 8)) (.cse0 (<= .cse69 2147483647)) (.cse67 (* .cse69 8)) (.cse66 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296))) (let ((.cse40 (<= .cse66 2147483647)) (.cse27 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse67 (- 34359738368))) (.cse37 (not .cse0)) (.cse25 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse68 (- 34359738368))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse7 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse68)) (.cse15 (+ c_~N~0 10)) (.cse16 (not .cse17)) (.cse36 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse67)) (.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse39 (* .cse66 8))) (and (or (let ((.cse38 (select .cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse39 (- 34359738368))))) (let ((.cse28 (+ .cse38 2)) (.cse14 (+ .cse38 4))) (and (or .cse0 (let ((.cse12 (store .cse26 .cse27 .cse28))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse11 (store (store .cse12 .cse13 .cse14) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse11))) (let ((.cse9 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse2 (store .cse9 .cse10 (+ .cse5 .cse6 2)))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 .cse3 (+ .cse4 .cse5 .cse6 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse4 .cse5 .cse6))))))) .cse15))) .cse16) (or .cse17 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= (let ((.cse24 (store (store .cse12 .cse25 .cse14) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse24))) (let ((.cse23 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse24 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse20 (store .cse23 .cse10 (+ .cse18 .cse21 2)))) (let ((.cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse3 (+ .cse18 .cse21 .cse22 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse21 .cse22))))))) .cse15) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse35 (store (store (store .cse26 .cse36 .cse28) .cse13 .cse14) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse35))) (let ((.cse34 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse29 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse32 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store .cse34 .cse10 (+ .cse29 .cse32 2)))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 .cse3 (+ .cse29 .cse32 .cse33 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse32 .cse33))))))) .cse15))) .cse37)))) .cse40) (or (not .cse40) (let ((.cse65 (select .cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse39)))) (let ((.cse49 (+ .cse65 4)) (.cse48 (+ .cse65 2))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= (let ((.cse47 (store (store (store .cse26 .cse27 .cse48) .cse25 .cse49) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47))) (let ((.cse46 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse44 (store .cse46 .cse10 (+ .cse41 .cse42 2)))) (let ((.cse45 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse3 (+ .cse41 .cse42 .cse45 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse45))))))) .cse15) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))) (or .cse37 (let ((.cse57 (store .cse26 .cse36 .cse48))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse56 (store (store .cse57 .cse25 .cse49) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse56))) (let ((.cse55 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse50 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse51 (select .cse56 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse54 (store .cse55 .cse10 (+ .cse50 .cse51 2)))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse50 .cse51 .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse54 .cse3 (+ .cse50 .cse51 .cse52 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7)))))))) .cse15))) .cse17) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse64 (store (store .cse57 .cse13 .cse49) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse64))) (let ((.cse63 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse58 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse59 (select .cse64 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse61 (store .cse63 .cse10 (+ .cse58 .cse59 2)))) (let ((.cse62 (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse61 .cse3 (+ .cse58 .cse59 .cse62 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse62))))))) .cse15))) .cse16)))))))))))) (not (< 3 c_~N~0))) is different from true [2023-02-15 19:07:38,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:07:38,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:07:38,445 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 19:07:38,446 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1618 treesize of output 1 [2023-02-15 19:07:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 19:07:38,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:07:38,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231816100] [2023-02-15 19:07:38,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:07:38,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767093055] [2023-02-15 19:07:38,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767093055] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:07:38,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:07:38,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2023-02-15 19:07:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747378122] [2023-02-15 19:07:38,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:07:38,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 19:07:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:07:38,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 19:07:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1731, Unknown=2, NotChecked=88, Total=2162 [2023-02-15 19:07:38,449 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 47 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 47 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-15 19:07:40,519 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse110 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse45 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296))) (let ((.cse109 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse104 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse28 (* .cse45 8)) (.cse105 (* .cse110 8))) (let ((.cse108 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse105)) (.cse68 (select .cse104 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse28))) (.cse44 (select .cse15 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse28))) (.cse103 (mod .cse109 4294967296))) (let ((.cse102 (* .cse103 8)) (.cse66 (store .cse104 .cse108 (+ .cse68 .cse44 2))) (.cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse105)) (.cse107 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse3 (<= .cse110 2147483647)) (.cse56 (< .cse107 c_~N~0)) (.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse66) |c_ULTIMATE.start_main_~b~0#1.base|) .cse26)) (.cse65 (< .cse109 c_~N~0)) (.cse106 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse102)) (.cse48 (select .cse104 .cse108)) (.cse50 (select .cse15 .cse26))) (let ((.cse46 (store .cse104 .cse106 (+ .cse48 .cse50 2))) (.cse55 (not .cse65)) (.cse53 (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0)) (.cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (mod .cse107 4294967296) 8))) (.cse57 (store .cse66 .cse106 (+ .cse67 .cse68 .cse44 4))) (.cse54 (not .cse56)) (.cse27 (not .cse3)) (.cse49 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse102)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse11 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse18 (+ c_~N~0 10)) (.cse16 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse105 (- 34359738368))) (.cse0 (< 4 c_~N~0)) (.cse1 (not (< 3 c_~N~0))) (.cse51 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse52 (+ c_~N~0 16))) (and (or .cse0 .cse1 (let ((.cse2 (<= .cse45 2147483647))) (and (or .cse2 (let ((.cse17 (+ (select .cse15 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse28 (- 34359738368))) 2))) (and (or .cse3 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse14 (store (store .cse15 .cse16 .cse17) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse14))) (let ((.cse12 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse8 (store .cse12 .cse13 (+ .cse5 .cse6 2)))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse4 .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse9 (+ .cse4 .cse5 .cse6 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)))))))) .cse18)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse25 (store (store .cse15 .cse26 .cse17) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse25))) (let ((.cse24 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse23 (store .cse24 .cse13 (+ .cse19 .cse21 2)))) (let ((.cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse19 .cse20 .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse9 (+ .cse19 .cse20 .cse21 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)))))))) .cse18))) .cse27)))) (or (let ((.cse36 (+ .cse44 2))) (and (or .cse3 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse35 (store (store .cse15 .cse16 .cse36) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse35))) (let ((.cse34 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (store .cse34 .cse13 (+ .cse30 .cse33 2)))) (let ((.cse29 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse29 .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse9 (+ .cse29 .cse30 .cse33 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse33))))))) .cse18)))) (or .cse27 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse43 (store (store .cse15 .cse26 .cse36) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse43))) (let ((.cse42 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse39 (select .cse43 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse40 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store .cse42 .cse13 (+ .cse39 .cse40 2)))) (let ((.cse41 (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse38 .cse9 (+ .cse39 .cse40 .cse41 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse39 .cse40 .cse41))))))) .cse18)))))) (not .cse2))))) (<= c_~N~0 2147483647) (or (= (select (store .cse46 .cse47 (+ .cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~b~0#1.base|) .cse49) .cse50 4)) .cse51) .cse52) .cse53 .cse1 .cse54) (or .cse55 (= (select .cse46 .cse51) .cse52) .cse56 .cse1) (or .cse55 .cse56 .cse1 (= (select .cse57 .cse51) .cse52)) (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_735 Int)) (or (= (let ((.cse64 (store .cse15 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_735))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse64))) (let ((.cse63 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse58 (select .cse64 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse62 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (store .cse63 .cse13 (+ .cse58 .cse62 2)))) (let ((.cse61 (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse60 .cse9 (+ .cse58 .cse61 .cse62 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse61 .cse62))))))) .cse18) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)))) .cse1) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse65 (= (select .cse66 .cse51) .cse52) .cse1) (or .cse53 .cse1 (= (select (store .cse57 .cse47 (+ .cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~b~0#1.base|) .cse49) .cse68 .cse44 6)) .cse51) .cse52) .cse54) (or (let ((.cse86 (<= .cse103 2147483647))) (let ((.cse77 (not .cse86)) (.cse85 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse102 (- 34359738368)))) (and (or .cse27 (let ((.cse76 (+ .cse50 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse75 (store (store .cse15 .cse49 .cse76) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse75))) (let ((.cse74 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse69 (select .cse75 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse71 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse73 (store .cse74 .cse13 (+ .cse69 .cse71 2)))) (let ((.cse70 (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse69 .cse70 .cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse73 .cse9 (+ .cse69 .cse70 .cse71 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)))))))) .cse18))) .cse77) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse84 (store (store .cse15 .cse85 .cse76) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse84))) (let ((.cse83 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse81 (select .cse83 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse82 (select .cse84 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse79 (store .cse83 .cse13 (+ .cse81 .cse82 2)))) (let ((.cse80 (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse79 .cse9 (+ .cse80 .cse81 .cse82 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse80 .cse81 .cse82))))))) .cse18))) .cse86)))) (or (let ((.cse94 (+ (select .cse15 .cse16) 2))) (and (or .cse77 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse93 (store (store .cse15 .cse49 .cse94) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse93))) (let ((.cse92 (select .cse90 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse87 (select .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse88 (select .cse93 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse91 (store .cse92 .cse13 (+ .cse87 .cse88 2)))) (let ((.cse89 (select (select (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| .cse91) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse87 .cse88 .cse89 (select (select (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse91 .cse9 (+ .cse87 .cse88 .cse89 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)))))))) .cse18)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse101 (store (store .cse15 .cse85 .cse94) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse96 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse101))) (let ((.cse100 (select .cse96 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse95 (select .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse98 (select .cse101 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse97 (store .cse100 .cse13 (+ .cse95 .cse98 2)))) (let ((.cse99 (select (select (store .cse96 |c_ULTIMATE.start_main_~a~0#1.base| .cse97) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (+ .cse95 (select (select (store .cse96 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse97 .cse9 (+ .cse95 .cse98 .cse99 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse98 .cse99))))))) .cse18))) .cse86))) .cse3)))) .cse0 .cse1) (or .cse1 (= (select .cse104 .cse51) .cse52))))))))) is different from true [2023-02-15 19:07:44,000 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~N~0 1)) (.cse72 (<= (mod c_~N~0 4294967296) 536870911))) (and (< 0 c_~N~0) (not (<= c_~N~0 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= c_~N~0 2147483647) (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= (select v_DerPreprocessor_16 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) (= |c_ULTIMATE.start_main_~i~0#1| 1) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (< 4 c_~N~0) (let ((.cse70 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse71 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse18 (<= .cse71 2147483647)) (.cse69 (* .cse71 8)) (.cse1 (<= .cse70 2147483647)) (.cse68 (* .cse70 8)) (.cse67 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296))) (let ((.cse41 (<= .cse67 2147483647)) (.cse28 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse68 (- 34359738368))) (.cse38 (not .cse1)) (.cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse69 (- 34359738368))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse9 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse14 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse69)) (.cse16 (+ c_~N~0 10)) (.cse17 (not .cse18)) (.cse37 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse68)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse40 (* .cse67 8))) (and (or (let ((.cse39 (select .cse27 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse40 (- 34359738368))))) (let ((.cse29 (+ .cse39 2)) (.cse15 (+ .cse39 4))) (and (or .cse1 (let ((.cse13 (store .cse27 .cse28 .cse29))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse12 (store (store .cse13 .cse14 .cse15) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse12))) (let ((.cse10 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse3 (store .cse10 .cse11 (+ .cse6 .cse7 2)))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 (+ .cse5 .cse6 .cse7 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse5 .cse6 .cse7))))))) .cse16))) .cse17) (or .cse18 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= (let ((.cse25 (store (store .cse13 .cse26 .cse15) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse25))) (let ((.cse24 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse21 (store .cse24 .cse11 (+ .cse19 .cse22 2)))) (let ((.cse23 (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 .cse4 (+ .cse19 .cse22 .cse23 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse22 .cse23))))))) .cse16) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0))))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse36 (store (store (store .cse27 .cse37 .cse29) .cse14 .cse15) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse36))) (let ((.cse35 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (select .cse36 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (store .cse35 .cse11 (+ .cse30 .cse33 2)))) (let ((.cse34 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse4 (+ .cse30 .cse33 .cse34 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse33 .cse34))))))) .cse16))) .cse38)))) .cse41) (or (not .cse41) (let ((.cse66 (select .cse27 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse40)))) (let ((.cse50 (+ .cse66 4)) (.cse49 (+ .cse66 2))) (and (or .cse1 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= (let ((.cse48 (store (store (store .cse27 .cse28 .cse49) .cse26 .cse50) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse48))) (let ((.cse47 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (select .cse48 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse45 (store .cse47 .cse11 (+ .cse42 .cse43 2)))) (let ((.cse46 (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse42 .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse45 .cse4 (+ .cse42 .cse43 .cse46 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse46))))))) .cse16) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))) (or .cse38 (let ((.cse58 (store .cse27 .cse37 .cse49))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse57 (store (store .cse58 .cse26 .cse50) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse57))) (let ((.cse56 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse51 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse52 (select .cse57 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse55 (store .cse56 .cse11 (+ .cse51 .cse52 2)))) (let ((.cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse51 .cse52 .cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse55 .cse4 (+ .cse51 .cse52 .cse53 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8)))))))) .cse16))) .cse18) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse65 (store (store .cse58 .cse14 .cse50) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse65))) (let ((.cse64 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse60 (select .cse65 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse62 (store .cse64 .cse11 (+ .cse59 .cse60 2)))) (let ((.cse63 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse59 .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse62 .cse4 (+ .cse59 .cse60 .cse63 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse63))))))) .cse16))) .cse17)))))))))))) (not (< 3 c_~N~0))) .cse72 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (or (and (not .cse72) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse72)))) is different from true [2023-02-15 19:07:46,754 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse89 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse85 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296)) (.cse51 (select .cse14 .cse10)) (.cse45 (<= .cse89 2147483647)) (.cse88 (* .cse89 8)) (.cse9 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16))) (let ((.cse50 (select .cse14 .cse9)) (.cse48 (< 4 c_~N~0)) (.cse0 (not (< 3 c_~N~0))) (.cse44 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse88 (- 34359738368))) (.cse2 (not .cse45)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse28 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse88)) (.cse17 (+ c_~N~0 10)) (.cse49 (= .cse51 3)) (.cse52 (* 8 .cse85)) (.cse87 (= (select .cse14 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse86 (+ c_~N~0 1))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 c_~N~0) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) .cse0 (= (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (+ c_~N~0 16))) (or (let ((.cse47 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse46 (* .cse47 8)) (.cse27 (<= .cse47 2147483647))) (let ((.cse18 (not .cse27)) (.cse15 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse46)) (.cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse46 (- 34359738368)))) (and (or .cse2 (let ((.cse16 (+ (select .cse14 .cse28) 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse13 (store (store .cse14 .cse15 .cse16) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse13))) (let ((.cse11 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (store .cse11 .cse12 (+ .cse3 .cse5 2)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ .cse3 .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 .cse8 (+ .cse3 .cse4 .cse5 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))))))) .cse17))) .cse18) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse25 (store (store .cse14 .cse26 .cse16) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse25))) (let ((.cse24 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse20 (store .cse24 .cse12 (+ .cse22 .cse23 2)))) (let ((.cse21 (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse8 (+ .cse21 .cse22 .cse23 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9) .cse21 .cse22 .cse23))))))) .cse17))) .cse27)))) (or (let ((.cse36 (+ (select .cse14 .cse44) 2))) (and (or .cse18 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse35 (store (store .cse14 .cse15 .cse36) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse35))) (let ((.cse34 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse29 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse33 (store .cse34 .cse12 (+ .cse29 .cse30 2)))) (let ((.cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ .cse29 .cse30 .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 .cse8 (+ .cse29 .cse30 .cse31 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))))))) .cse17)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse43 (store (store .cse14 .cse26 .cse36) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse43))) (let ((.cse42 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse37 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse43 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse39 (store .cse42 .cse12 (+ .cse37 .cse40 2)))) (let ((.cse41 (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse39 .cse8 (+ .cse37 .cse40 .cse41 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9) .cse40 .cse41))))))) .cse17))) .cse27))) .cse45))))) .cse48 .cse0) .cse49 (<= (mod c_~N~0 4294967296) 536870911) (= .cse50 (+ .cse51 2)) (or (= .cse50 5) (= 16 .cse52)) (or .cse48 .cse0 (let ((.cse69 (* .cse85 8)) (.cse53 (<= .cse85 2147483647))) (and (or .cse53 (let ((.cse61 (+ (select .cse14 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse69 (- 34359738368))) 2))) (and (or .cse45 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse60 (store (store .cse14 .cse44 .cse61) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse60))) (let ((.cse59 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse55 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse60 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse58 (store .cse59 .cse12 (+ .cse55 .cse56 2)))) (let ((.cse54 (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ .cse54 .cse55 .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse58 .cse8 (+ .cse54 .cse55 .cse56 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))))))) .cse17)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse68 (store (store .cse14 .cse28 .cse61) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse68))) (let ((.cse67 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse62 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse64 (select .cse68 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse66 (store .cse67 .cse12 (+ .cse62 .cse64 2)))) (let ((.cse63 (select (select (store .cse65 |c_ULTIMATE.start_main_~a~0#1.base| .cse66) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ .cse62 .cse63 .cse64 (select (select (store .cse65 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse66 .cse8 (+ .cse62 .cse63 .cse64 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))))))) .cse17))) .cse2)))) (or (let ((.cse77 (+ (select .cse14 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse69)) 2))) (and (or .cse45 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse76 (store (store .cse14 .cse44 .cse77) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse76))) (let ((.cse75 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse71 (select .cse76 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse74 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse73 (store .cse75 .cse12 (+ .cse71 .cse74 2)))) (let ((.cse70 (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ .cse70 .cse71 (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse73 .cse8 (+ .cse70 .cse71 .cse74 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9) .cse74))))))) .cse17)))) (or .cse2 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse84 (store (store .cse14 .cse28 .cse77) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse84))) (let ((.cse83 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse80 (select .cse84 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse81 (select .cse83 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse79 (store .cse83 .cse12 (+ .cse80 .cse81 2)))) (let ((.cse82 (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10))) (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse79 .cse8 (+ .cse80 .cse81 .cse82 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9) .cse80 .cse81 .cse82))))))) .cse17)))))) (not .cse53))))) (< |c_ULTIMATE.start_main_~i~0#1| .cse86) (<= c_~N~0 2147483647) (or (= 8 .cse52) .cse49) (or (= 0 .cse52) .cse87) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse87 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse86))))) is different from true [2023-02-15 19:07:53,210 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse119 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse108 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296))) (let ((.cse42 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse92 (* .cse108 8)) (.cse12 (* .cse119 8)) (.cse117 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse121 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse118 (mod .cse117 4294967296)) (.cse120 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)) (.cse29 (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse92))) (.cse30 (select .cse42 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse92)))) (let ((.cse116 (store .cse11 .cse120 (+ .cse29 .cse30 2))) (.cse22 (* .cse118 8)) (.cse18 (mod .cse121 4294967296)) (.cse91 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse4 (< .cse121 c_~N~0)) (.cse114 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse8 (select .cse11 .cse120)) (.cse53 (select .cse42 .cse91)) (.cse14 (* .cse18 8)) (.cse10 (<= .cse119 2147483647)) (.cse37 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse21 (<= .cse118 2147483647)) (.cse25 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) (.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse116) |c_ULTIMATE.start_main_~b~0#1.base|) .cse91)) (.cse115 (< .cse117 c_~N~0))) (let ((.cse0 (not .cse115)) (.cse20 (store .cse116 .cse25 (+ .cse27 .cse29 .cse30 4))) (.cse24 (not .cse21)) (.cse71 (= (select .cse42 .cse37) 5)) (.cse70 (< 4 c_~N~0)) (.cse69 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse12 (- 34359738368))) (.cse7 (not .cse10)) (.cse36 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse44 (+ c_~N~0 10)) (.cse13 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse14)) (.cse1 (store .cse11 .cse25 (+ .cse8 .cse53 2))) (.cse28 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse22)) (.cse26 (< .cse114 c_~N~0)) (.cse19 (not .cse4)) (.cse73 (= (select .cse42 .cse38) 3)) (.cse6 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse3 (+ c_~N~0 16)) (.cse5 (not (< 3 c_~N~0))) (.cse72 (* 8 .cse108)) (.cse74 (= (select .cse42 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) (.cse109 (+ c_~N~0 1))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 c_~N~0) (or .cse0 (= (select .cse1 .cse2) .cse3) .cse4 .cse5) (or .cse6 (let ((.cse9 (+ c_~N~0 .cse13 (* 2 |c_ULTIMATE.start_main_~i~0#1|) 1))) (and (or .cse7 (= .cse8 .cse9)) (or .cse10 (= (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse12 (- 34359738368))) .cse9))))) (or (let ((.cse16 (<= .cse18 2147483647)) (.cse15 (+ c_~N~0 .cse13 (* 6 |c_ULTIMATE.start_main_~i~0#1|) 9))) (and (or (= (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse14 (- 34359738368))) .cse15) .cse16) (or (not .cse16) (= (select .cse11 .cse17) .cse15)))) .cse19) (or .cse0 .cse4 .cse5 (= (select .cse20 .cse2) .cse3)) (or .cse0 (let ((.cse23 (+ c_~N~0 .cse13 (* 4 |c_ULTIMATE.start_main_~i~0#1|) 4))) (and (or .cse21 (= (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse22 (- 34359738368))) .cse23)) (or .cse24 (= (select .cse11 .cse25) .cse23))))) (or .cse26 .cse5 (= (select (store .cse20 .cse17 (+ .cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~b~0#1.base|) .cse28) .cse29 .cse30 6)) .cse2) .cse3) .cse19) (or (let ((.cse52 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse22 (- 34359738368)))) (and (or .cse7 (let ((.cse43 (+ .cse53 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse41 (store (store .cse42 .cse28 .cse43) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse41))) (let ((.cse39 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse35 (store .cse39 .cse40 (+ .cse31 .cse33 2)))) (let ((.cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ .cse31 .cse32 .cse33 (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse35 .cse36 (+ .cse31 .cse32 .cse33 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37)))))))) .cse44))) .cse24) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse51 (store (store .cse42 .cse52 .cse43) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse51))) (let ((.cse50 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse48 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse46 (store .cse50 .cse40 (+ .cse48 .cse49 2)))) (let ((.cse47 (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 .cse36 (+ .cse47 .cse48 .cse49 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37) .cse47 .cse48 .cse49))))))) .cse44))) .cse21)))) (or (let ((.cse61 (+ (select .cse42 .cse69) 2))) (and (or .cse24 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse60 (store (store .cse42 .cse28 .cse61) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse60))) (let ((.cse59 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse54 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse55 (select .cse60 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse58 (store .cse59 .cse40 (+ .cse54 .cse55 2)))) (let ((.cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ .cse54 .cse55 .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse58 .cse36 (+ .cse54 .cse55 .cse56 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37)))))))) .cse44)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse68 (store (store .cse42 .cse52 .cse61) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse68))) (let ((.cse67 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse62 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse68 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse64 (store .cse67 .cse40 (+ .cse62 .cse65 2)))) (let ((.cse66 (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ .cse62 (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 .cse36 (+ .cse62 .cse65 .cse66 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37) .cse65 .cse66))))))) .cse44))) .cse21))) .cse10))) .cse70 .cse5) (<= (mod c_~N~0 4294967296) 536870911) (or .cse71 (= 16 .cse72)) (or (and (<= (+ (* 4294967296 (div (+ c_~N~0 4294967292) 4294967296)) 3) c_~N~0) .cse73 .cse74) (and .cse71 (or (and .cse74 (<= (+ (* 4294967296 (div (+ c_~N~0 4294967293) 4294967296)) 2) c_~N~0)) (and .cse73 .cse74)))) (or .cse70 .cse5 (let ((.cse75 (<= .cse108 2147483647))) (and (or .cse75 (let ((.cse83 (+ (select .cse42 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse92 (- 34359738368))) 2))) (and (or .cse10 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse82 (store (store .cse42 .cse69 .cse83) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse82))) (let ((.cse81 (select .cse79 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse77 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse82 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse80 (store .cse81 .cse40 (+ .cse77 .cse78 2)))) (let ((.cse76 (select (select (store .cse79 |c_ULTIMATE.start_main_~a~0#1.base| .cse80) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ .cse76 .cse77 .cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse80 .cse36 (+ .cse76 .cse77 .cse78 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37)))))))) .cse44)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse90 (store (store .cse42 .cse91 .cse83) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse90))) (let ((.cse89 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse84 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse86 (select .cse90 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse88 (store .cse89 .cse40 (+ .cse84 .cse86 2)))) (let ((.cse85 (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ .cse84 .cse85 .cse86 (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse88 .cse36 (+ .cse84 .cse85 .cse86 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37)))))))) .cse44))) .cse7)))) (or (let ((.cse100 (+ .cse30 2))) (and (or .cse10 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse99 (store (store .cse42 .cse69 .cse100) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse99))) (let ((.cse98 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse94 (select .cse99 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse97 (select .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse96 (store .cse98 .cse40 (+ .cse94 .cse97 2)))) (let ((.cse93 (select (select (store .cse95 |c_ULTIMATE.start_main_~a~0#1.base| .cse96) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ .cse93 .cse94 (select (select (store .cse95 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse96 .cse36 (+ .cse93 .cse94 .cse97 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37) .cse97))))))) .cse44)))) (or .cse7 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse107 (store (store .cse42 .cse91 .cse100) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse101 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse107))) (let ((.cse106 (select .cse101 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse103 (select .cse107 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse104 (select .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse102 (store .cse106 .cse40 (+ .cse103 .cse104 2)))) (let ((.cse105 (select (select (store .cse101 |c_ULTIMATE.start_main_~a~0#1.base| .cse102) |c_ULTIMATE.start_main_~b~0#1.base|) .cse38))) (+ (select (select (store .cse101 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse102 .cse36 (+ .cse103 .cse104 .cse105 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse37) .cse103 .cse104 .cse105))))))) .cse44)))))) (not .cse75))))) (< |c_ULTIMATE.start_main_~i~0#1| .cse109) (<= c_~N~0 2147483647) (or (not .cse26) (let ((.cse113 (mod .cse114 4294967296))) (let ((.cse111 (* .cse113 8)) (.cse112 (+ c_~N~0 .cse13 (* 8 |c_ULTIMATE.start_main_~i~0#1|) 16)) (.cse110 (<= .cse113 2147483647))) (and (or (not .cse110) (= (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse111)) .cse112)) (or (= (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse111 (- 34359738368))) .cse112) .cse110))))) (or (= (select (store .cse1 .cse17 (+ .cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|) .cse28) .cse53 4)) .cse2) .cse3) .cse26 .cse5 .cse19) (or (= 8 .cse72) .cse73) (or .cse6 .cse115 (= (select .cse116 .cse2) .cse3) .cse5) (or (= 0 .cse72) .cse74) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse109)))))))) is different from true [2023-02-15 19:07:55,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:08:57,328 WARN L233 SmtUtils]: Spent 50.11s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:09:02,650 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-15 19:09:14,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:09:43,516 WARN L233 SmtUtils]: Spent 15.64s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:09:46,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:09:48,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:09:58,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:10:02,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:10:04,999 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse95 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse50 (select .cse12 .cse8)) (.cse84 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296)) (.cse43 (<= .cse95 2147483647)) (.cse94 (* .cse95 8)) (.cse7 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16))) (let ((.cse49 (select .cse12 .cse7)) (.cse46 (< 4 c_~N~0)) (.cse47 (not (< 3 c_~N~0))) (.cse42 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse94 (- 34359738368))) (.cse0 (not .cse43)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse94)) (.cse15 (+ c_~N~0 10)) (.cse68 (* .cse84 8)) (.cse48 (= .cse50 3)) (.cse51 (* 8 .cse84)) (.cse93 (= (select .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) (.cse90 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse85 (+ c_~N~0 1))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 c_~N~0) (or (let ((.cse45 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse44 (* .cse45 8)) (.cse25 (<= .cse45 2147483647))) (let ((.cse16 (not .cse25)) (.cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse44)) (.cse24 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse44 (- 34359738368)))) (and (or .cse0 (let ((.cse14 (+ (select .cse12 .cse26) 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse11 (store (store .cse12 .cse13 .cse14) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse11))) (let ((.cse9 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse9 .cse10 (+ .cse1 .cse3 2)))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse1 .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 (+ .cse1 .cse2 .cse3 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7)))))))) .cse15))) .cse16) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse23 (store (store .cse12 .cse24 .cse14) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse23))) (let ((.cse22 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse18 (store .cse22 .cse10 (+ .cse20 .cse21 2)))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse18 .cse6 (+ .cse19 .cse20 .cse21 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse19 .cse20 .cse21))))))) .cse15))) .cse25)))) (or (let ((.cse34 (+ (select .cse12 .cse42) 2))) (and (or .cse16 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse33 (store (store .cse12 .cse13 .cse34) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse33))) (let ((.cse32 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse31 (store .cse32 .cse10 (+ .cse27 .cse28 2)))) (let ((.cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 .cse6 (+ .cse27 .cse28 .cse29 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7)))))))) .cse15)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse41 (store (store .cse12 .cse24 .cse34) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse41))) (let ((.cse40 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse38 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse37 (store .cse40 .cse10 (+ .cse35 .cse38 2)))) (let ((.cse39 (select (select (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse37 .cse6 (+ .cse35 .cse38 .cse39 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse38 .cse39))))))) .cse15))) .cse25))) .cse43))))) .cse46 .cse47) .cse48 (<= (mod c_~N~0 4294967296) 536870911) (= .cse49 (+ .cse50 2)) (or (= .cse49 5) (= 16 .cse51)) (or .cse46 .cse47 (let ((.cse52 (<= .cse84 2147483647))) (and (or .cse52 (let ((.cse60 (+ (select .cse12 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse68 (- 34359738368))) 2))) (and (or .cse43 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse59 (store (store .cse12 .cse42 .cse60) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse59))) (let ((.cse58 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse54 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse55 (select .cse59 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse57 (store .cse58 .cse10 (+ .cse54 .cse55 2)))) (let ((.cse53 (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse53 .cse54 .cse55 (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse57 .cse6 (+ .cse53 .cse54 .cse55 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7)))))))) .cse15)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse67 (store (store .cse12 .cse26 .cse60) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse67))) (let ((.cse66 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse67 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse65 (store .cse66 .cse10 (+ .cse61 .cse63 2)))) (let ((.cse62 (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| .cse65) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse61 .cse62 .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse65 .cse6 (+ .cse61 .cse62 .cse63 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7)))))))) .cse15))) .cse0)))) (or (let ((.cse76 (+ (select .cse12 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse68)) 2))) (and (or .cse43 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse75 (store (store .cse12 .cse42 .cse76) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse75))) (let ((.cse74 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse70 (select .cse75 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse73 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse72 (store .cse74 .cse10 (+ .cse70 .cse73 2)))) (let ((.cse69 (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ .cse69 .cse70 (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse72 .cse6 (+ .cse69 .cse70 .cse73 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse73))))))) .cse15)))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_735 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse83 (store (store .cse12 .cse26 .cse76) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8)) v_ArrVal_735))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse83))) (let ((.cse82 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse79 (select .cse83 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse80 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse78 (store .cse82 .cse10 (+ .cse79 .cse80 2)))) (let ((.cse81 (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse78) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse78 .cse6 (+ .cse79 .cse80 .cse81 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7) .cse79 .cse80 .cse81))))))) .cse15)))))) (not .cse52))))) (< |c_ULTIMATE.start_main_~i~0#1| .cse85) (= |c_ULTIMATE.start_main_~i~0#1| 4) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse92 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967294) 4294967296) 8)) (.cse86 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse91 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967293) 4294967296) 8))) (let ((.cse88 (select .cse86 .cse91)) (.cse87 (select .cse90 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse92))) (.cse89 (select .cse86 0))) (and (= (select .cse86 8) 3) (= .cse87 (+ c_~N~0 .cse88 .cse89 5)) (= (+ (select .cse90 (+ .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse88 2) .cse87) (= (select .cse90 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse68)) (+ (select .cse86 .cse92) .cse87 2)) (= .cse89 1) (= (select .cse86 16) 5))))) (<= c_~N~0 2147483647) (or (= 8 .cse51) .cse48) (or (= 0 .cse51) .cse93) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse93 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse85))))) is different from true [2023-02-15 19:10:07,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:10:09,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:10:11,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:10:16,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]