./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/modn.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/modn.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 b1b107a3e17c36933ddc5a5cff6ab95f9f0d71df794eec32ec4a28d109efd829 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:32:43,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:32:43,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:32:43,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:32:43,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:32:43,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:32:43,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:32:43,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:32:43,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:32:43,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:32:43,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:32:43,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:32:43,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:32:43,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:32:43,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:32:43,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:32:43,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:32:43,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:32:43,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:32:43,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:32:43,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:32:43,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:32:43,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:32:43,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:32:43,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:32:43,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:32:43,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:32:43,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:32:43,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:32:43,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:32:43,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:32:43,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:32:43,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:32:43,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:32:43,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:32:43,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:32:43,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:32:43,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:32:43,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:32:43,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:32:43,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:32:43,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:32:43,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:32:43,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:32:43,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:32:43,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:32:43,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:32:43,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:32:43,479 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:32:43,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:32:43,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:32:43,480 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:32:43,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:32:43,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:32:43,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:32:43,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:32:43,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:32:43,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:32:43,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:32:43,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:32:43,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:32:43,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:32:43,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:32:43,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:32:43,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:32:43,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:32:43,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:32:43,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:32:43,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:32:43,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:32:43,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:32:43,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:32:43,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:32:43,486 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:32:43,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:32:43,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:32:43,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b107a3e17c36933ddc5a5cff6ab95f9f0d71df794eec32ec4a28d109efd829 [2022-07-19 10:32:43,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:32:43,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:32:43,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:32:43,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:32:43,776 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:32:43,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/modn.c [2022-07-19 10:32:43,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18932c16f/4fb671f14e64431cbca91f82e18ab104/FLAGd916e23b9 [2022-07-19 10:32:44,209 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:32:44,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c [2022-07-19 10:32:44,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18932c16f/4fb671f14e64431cbca91f82e18ab104/FLAGd916e23b9 [2022-07-19 10:32:44,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18932c16f/4fb671f14e64431cbca91f82e18ab104 [2022-07-19 10:32:44,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:32:44,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:32:44,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:32:44,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:32:44,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:32:44,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c839d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44, skipping insertion in model container [2022-07-19 10:32:44,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:32:44,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:32:44,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c[587,600] [2022-07-19 10:32:44,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:32:44,384 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:32:44,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c[587,600] [2022-07-19 10:32:44,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:32:44,411 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:32:44,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44 WrapperNode [2022-07-19 10:32:44,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:32:44,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:32:44,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:32:44,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:32:44,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,458 INFO L137 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-07-19 10:32:44,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:32:44,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:32:44,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:32:44,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:32:44,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:32:44,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:32:44,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:32:44,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:32:44,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (1/1) ... [2022-07-19 10:32:44,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:32:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:44,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:32:44,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:32:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:32:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:32:44,608 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:32:44,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:32:44,722 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:32:44,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:32:44,727 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 10:32:44,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:32:44 BoogieIcfgContainer [2022-07-19 10:32:44,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:32:44,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:32:44,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:32:44,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:32:44,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:32:44" (1/3) ... [2022-07-19 10:32:44,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe0dd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:32:44, skipping insertion in model container [2022-07-19 10:32:44,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:44" (2/3) ... [2022-07-19 10:32:44,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe0dd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:32:44, skipping insertion in model container [2022-07-19 10:32:44,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:32:44" (3/3) ... [2022-07-19 10:32:44,737 INFO L111 eAbstractionObserver]: Analyzing ICFG modn.c [2022-07-19 10:32:44,750 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:32:44,751 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:32:44,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:32:44,796 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18dd9e3d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1708fe81 [2022-07-19 10:32:44,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:32:44,800 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) [2022-07-19 10:32:44,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:32:44,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:44,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:44,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-07-19 10:32:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:44,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395247340] [2022-07-19 10:32:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:32:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395247340] [2022-07-19 10:32:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395247340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:32:44,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:32:44,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:32:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808298155] [2022-07-19 10:32:44,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:32:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:32:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:32:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:32:45,002 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) [2022-07-19 10:32:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:45,013 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-19 10:32:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:32:45,015 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 [2022-07-19 10:32:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:45,021 INFO L225 Difference]: With dead ends: 38 [2022-07-19 10:32:45,021 INFO L226 Difference]: Without dead ends: 17 [2022-07-19 10:32:45,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:32:45,026 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 [2022-07-19 10:32:45,027 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] [2022-07-19 10:32:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-19 10:32:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-19 10:32:45,049 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) [2022-07-19 10:32:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-19 10:32:45,051 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-19 10:32:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:45,052 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-19 10:32:45,052 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) [2022-07-19 10:32:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-19 10:32:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:32:45,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:45,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:32:45,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:45,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-07-19 10:32:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:45,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265576833] [2022-07-19 10:32:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:45,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:32:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:45,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265576833] [2022-07-19 10:32:45,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265576833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:32:45,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:32:45,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:32:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329098723] [2022-07-19 10:32:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:32:45,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:32:45,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:32:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:32:45,146 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2022-07-19 10:32:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:45,219 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-19 10:32:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:32:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2022-07-19 10:32:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:45,221 INFO L225 Difference]: With dead ends: 37 [2022-07-19 10:32:45,221 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 10:32:45,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:32:45,223 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:45,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:32:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 10:32:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-19 10:32:45,228 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) [2022-07-19 10:32:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-19 10:32:45,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-07-19 10:32:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:45,229 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-19 10:32:45,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2022-07-19 10:32:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-19 10:32:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:32:45,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:45,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:45,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:32:45,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-07-19 10:32:45,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:45,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815577903] [2022-07-19 10:32:45,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:45,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:45,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054344136] [2022-07-19 10:32:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:45,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:45,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:45,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:45,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:32:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:32:45,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 10:32:45,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:45,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:32:45,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-19 10:32:45,766 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-19 10:32:45,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-07-19 10:32:46,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-19 10:32:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:46,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:32:48,327 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~N~0 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse5 c_~N~0) 0)) (.cse1 (< .cse5 0)) (.cse4 (not .cse3))) (and (or (and (not .cse0) .cse1) (let ((.cse2 (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse2 .cse3) (or .cse4 .cse2)))) (or .cse0 (not .cse1) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse3) (or (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4)))))) is different from false [2022-07-19 10:32:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 10:32:57,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:57,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815577903] [2022-07-19 10:32:57,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:32:57,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054344136] [2022-07-19 10:32:57,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054344136] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:32:57,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:32:57,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-19 10:32:57,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501065818] [2022-07-19 10:32:57,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:32:57,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:32:57,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:32:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=233, Unknown=3, NotChecked=32, Total=342 [2022-07-19 10:32:57,511 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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) [2022-07-19 10:32:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:58,866 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-19 10:32:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:32:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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 16 [2022-07-19 10:32:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:58,868 INFO L225 Difference]: With dead ends: 36 [2022-07-19 10:32:58,868 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 10:32:58,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=135, Invalid=372, Unknown=3, NotChecked=42, Total=552 [2022-07-19 10:32:58,870 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:58,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 58 Unchecked, 0.5s Time] [2022-07-19 10:32:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 10:32:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-19 10:32:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2022-07-19 10:32:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-19 10:32:58,877 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2022-07-19 10:32:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:58,878 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-19 10:32:58,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 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) [2022-07-19 10:32:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-19 10:32:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:32:58,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:58,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:58,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:32:59,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:59,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:59,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1267903976, now seen corresponding path program 2 times [2022-07-19 10:32:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:59,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637112536] [2022-07-19 10:32:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:59,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:59,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972313518] [2022-07-19 10:32:59,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:32:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:59,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:59,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:32:59,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:32:59,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:32:59,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:32:59,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:59,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:32:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:59,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637112536] [2022-07-19 10:32:59,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:32:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972313518] [2022-07-19 10:32:59,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972313518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:32:59,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:32:59,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-19 10:32:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699926225] [2022-07-19 10:32:59,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:32:59,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:32:59,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:32:59,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:32:59,787 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) [2022-07-19 10:33:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:33:00,396 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-19 10:33:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:33:00,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 18 [2022-07-19 10:33:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:33:00,397 INFO L225 Difference]: With dead ends: 61 [2022-07-19 10:33:00,397 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 10:33:00,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:33:00,399 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:33:00,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 45 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:33:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 10:33:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-07-19 10:33:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 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) [2022-07-19 10:33:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-19 10:33:00,406 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-07-19 10:33:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:33:00,406 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-19 10:33:00,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) [2022-07-19 10:33:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-19 10:33:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:33:00,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:33:00,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:33:00,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 10:33:00,615 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,SelfDestructingSolverStorable3 [2022-07-19 10:33:00,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:33:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:33:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 3 times [2022-07-19 10:33:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:33:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735516747] [2022-07-19 10:33:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:33:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:33:00,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:33:00,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537414616] [2022-07-19 10:33:00,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:33:00,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:00,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:33:00,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:33:00,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:33:00,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 10:33:00,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:33:00,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 10:33:00,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:33:01,834 INFO L356 Elim1Store]: treesize reduction 40, result has 56.0 percent of original size [2022-07-19 10:33:01,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 96 [2022-07-19 10:33:06,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:33:06,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-07-19 10:33:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:33:07,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:33:08,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:33:08,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 107 [2022-07-19 10:33:08,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-19 10:33:08,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2022-07-19 10:33:09,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-19 10:33:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:33:10,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:33:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735516747] [2022-07-19 10:33:10,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:33:10,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537414616] [2022-07-19 10:33:10,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537414616] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:33:10,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:33:10,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-07-19 10:33:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170394477] [2022-07-19 10:33:10,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:33:10,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:33:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:33:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:33:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:33:10,361 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2022-07-19 10:33:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:33:10,761 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-07-19 10:33:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:33:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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 18 [2022-07-19 10:33:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:33:10,762 INFO L225 Difference]: With dead ends: 29 [2022-07-19 10:33:10,762 INFO L226 Difference]: Without dead ends: 24 [2022-07-19 10:33:10,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:33:10,764 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:33:10,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 34 Unchecked, 0.3s Time] [2022-07-19 10:33:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-19 10:33:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-19 10:33:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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) [2022-07-19 10:33:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-19 10:33:10,769 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2022-07-19 10:33:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:33:10,769 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-19 10:33:10,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2022-07-19 10:33:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-19 10:33:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:33:10,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:33:10,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:33:10,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 10:33:10,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:10,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:33:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:33:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 4 times [2022-07-19 10:33:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:33:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900914635] [2022-07-19 10:33:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:33:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:33:11,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:33:11,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848391927] [2022-07-19 10:33:11,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:33:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:33:11,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:33:11,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:33:11,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:33:11,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:33:11,050 WARN L261 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 10:33:11,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:33:11,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:33:11,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:33:11,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:33:12,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:12,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 10:33:12,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:12,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-07-19 10:33:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:13,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-19 10:33:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:33:13,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:33:16,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) is different from false [2022-07-19 10:33:39,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_44|)) (let ((.cse0 (forall ((v_ArrVal_135 Int)) (= (select (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod .cse4 ~N~0)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (.cse1 (< ~N~0 0))) (and (or .cse0 (not .cse1)) (let ((.cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (or (= (mod .cse2 ~N~0) 0) (not (< .cse2 0)))) (or .cse0 .cse1))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:33:42,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_44|)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (let ((.cse0 (forall ((v_ArrVal_135 Int)) (= (select (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod .cse4 ~N~0)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (.cse1 (< ~N~0 0))) (and (or .cse0 (not .cse1)) (let ((.cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (or (= (mod .cse2 ~N~0) 0) (not (< .cse2 0)))) (or .cse0 .cse1))))) is different from false [2022-07-19 10:33:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 10:33:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:33:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900914635] [2022-07-19 10:33:51,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:33:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848391927] [2022-07-19 10:33:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848391927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:33:51,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:33:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-19 10:33:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208735792] [2022-07-19 10:33:51,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:33:51,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:33:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:33:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:33:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=346, Unknown=13, NotChecked=120, Total=552 [2022-07-19 10:33:51,675 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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) [2022-07-19 10:33:56,417 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) (exists ((~N~0 Int)) (and (< 1 ~N~0) (<= ~N~0 2) (= (mod 2 ~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-19 10:33:58,426 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) (exists ((~N~0 Int)) (and (< 1 ~N~0) (<= ~N~0 2) (= (mod 2 ~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-19 10:33:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:33:58,871 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-19 10:33:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 10:33:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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 [2022-07-19 10:33:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:33:58,872 INFO L225 Difference]: With dead ends: 49 [2022-07-19 10:33:58,872 INFO L226 Difference]: Without dead ends: 47 [2022-07-19 10:33:58,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=88, Invalid=422, Unknown=16, NotChecked=230, Total=756 [2022-07-19 10:33:58,875 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:33:58,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 123 Unchecked, 0.3s Time] [2022-07-19 10:33:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-19 10:33:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-07-19 10:33:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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) [2022-07-19 10:33:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-19 10:33:58,883 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2022-07-19 10:33:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:33:58,883 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-19 10:33:58,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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) [2022-07-19 10:33:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-19 10:33:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:33:58,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:33:58,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:33:58,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:33:59,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:59,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:33:59,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:33:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1232945932, now seen corresponding path program 1 times [2022-07-19 10:33:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:33:59,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573600031] [2022-07-19 10:33:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:33:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:33:59,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:33:59,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923684082] [2022-07-19 10:33:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:33:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:33:59,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:33:59,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:33:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:33:59,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 10:33:59,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:33:59,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:33:59,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:33:59,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-19 10:33:59,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-19 10:33:59,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2022-07-19 10:34:00,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:00,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 52 [2022-07-19 10:34:02,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2022-07-19 10:34:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:02,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:21,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573600031] [2022-07-19 10:34:21,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:34:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923684082] [2022-07-19 10:34:21,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923684082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:21,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:34:21,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-07-19 10:34:21,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701914263] [2022-07-19 10:34:21,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:21,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 10:34:21,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:21,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 10:34:21,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=487, Unknown=4, NotChecked=0, Total=600 [2022-07-19 10:34:21,375 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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) [2022-07-19 10:34:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:22,839 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-07-19 10:34:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:34:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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 [2022-07-19 10:34:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:22,840 INFO L225 Difference]: With dead ends: 69 [2022-07-19 10:34:22,840 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 10:34:22,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=136, Invalid=616, Unknown=4, NotChecked=0, Total=756 [2022-07-19 10:34:22,841 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:22,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 55 Unchecked, 0.8s Time] [2022-07-19 10:34:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 10:34:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-19 10:34:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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) [2022-07-19 10:34:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-19 10:34:22,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 24 [2022-07-19 10:34:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:22,851 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-19 10:34:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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) [2022-07-19 10:34:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-19 10:34:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:34:22,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:22,852 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:22,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:34:23,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:23,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -900609774, now seen corresponding path program 5 times [2022-07-19 10:34:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53194357] [2022-07-19 10:34:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:23,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:34:23,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8626095] [2022-07-19 10:34:23,088 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:34:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:23,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:23,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:34:23,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:34:23,153 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-19 10:34:23,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:23,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:34:23,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:23,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:24,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:24,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53194357] [2022-07-19 10:34:24,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:34:24,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8626095] [2022-07-19 10:34:24,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8626095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:24,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:34:24,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-19 10:34:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197968050] [2022-07-19 10:34:24,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:24,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:34:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:34:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:34:24,523 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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) [2022-07-19 10:34:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:25,974 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-07-19 10:34:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:34:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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 [2022-07-19 10:34:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:25,976 INFO L225 Difference]: With dead ends: 123 [2022-07-19 10:34:25,976 INFO L226 Difference]: Without dead ends: 85 [2022-07-19 10:34:25,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:34:25,978 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 199 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:25,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 87 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 10:34:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-19 10:34:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 51. [2022-07-19 10:34:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 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) [2022-07-19 10:34:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-19 10:34:25,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-07-19 10:34:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:25,987 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-19 10:34:25,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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) [2022-07-19 10:34:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-19 10:34:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:34:25,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:25,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:26,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 10:34:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:26,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 6 times [2022-07-19 10:34:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:26,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980877788] [2022-07-19 10:34:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:26,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:34:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308476929] [2022-07-19 10:34:26,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:34:26,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:26,242 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:34:26,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:34:26,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-19 10:34:26,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:26,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-19 10:34:26,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:26,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:34:26,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:34:26,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:34:26,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:34:27,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:34:28,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-19 10:34:28,541 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-19 10:34:28,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2022-07-19 10:34:28,966 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-19 10:34:28,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2022-07-19 10:34:29,676 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-19 10:34:29,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 30 [2022-07-19 10:34:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:34:29,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:32,372 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (= (mod .cse5 c_~N~0) 0)) (.cse3 (< .cse5 0)) (.cse0 (not .cse1))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse1)) .cse2 (not .cse3)) (or (and (not .cse2) .cse3) (let ((.cse4 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse0 .cse4) (or .cse4 .cse1))))))) is different from false [2022-07-19 10:34:36,347 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (< c_~N~0 0)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse15 c_~N~0) 0)) (.cse1 (< .cse15 0)) (.cse8 (not .cse6))) (and (or (and (not .cse0) .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse3 c_~N~0) 0)) (< .cse3 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse4 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse4 0)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (= (select (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse8))) (or .cse0 (not .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse9 c_~N~0) 0)) (< .cse9 0))) (forall ((v_subst_3 Int)) (= (select (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse10 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse11 0)) (forall ((v_subst_1 Int)) (= (select (let ((.cse13 (* (- 1) c_~N~0))) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) (store .cse12 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse11 c_~N~0) 0))))) .cse6) (or .cse8 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse14 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))) is different from false [2022-07-19 10:34:40,047 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse55 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (< c_~N~0 0)) (.cse27 (mod .cse55 c_~N~0))) (let ((.cse0 (= .cse27 0)) (.cse1 (< .cse55 0)) (.cse25 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (not .cse28))) (and (or (and (not .cse0) .cse1) (and (or (forall ((v_subst_7 Int) (v_subst_3 Int)) (= (select (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse3 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4) (or (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse26 .cse27)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (= (mod .cse24 c_~N~0) 0)) (.cse14 (< .cse24 0))) (and (or (and (forall ((v_subst_4 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse5 (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse6 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (store .cse5 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse8 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse7 0) (not (= (mod .cse7 c_~N~0) 0)))))) (forall ((v_subst_5 Int)) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_subst_1 Int)) (= (select (let ((.cse10 (* (- 1) c_~N~0))) (let ((.cse9 (let ((.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse10))))) (store .cse9 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse10)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse12 c_~N~0) 0) (not (< .cse12 0)))))) (not .cse14) .cse15) (or (and (not .cse15) .cse14) (and (forall ((v_subst_9 Int)) (or (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse17 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse16 0) (not (= (mod .cse16 c_~N~0) 0)))) (forall ((v_subst_3 Int)) (= (select (let ((.cse18 (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse19 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse18 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_subst_8 Int)) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse23 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse20 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse21 (let ((.cse22 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse22 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse21 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse20 0)))))))))) .cse28))) (or .cse0 (not .cse1) (and (or (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse26 (+ .cse27 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse29 (= (mod .cse52 c_~N~0) 0)) (.cse42 (< .cse52 0))) (and (or .cse29 (and (forall ((v_subst_4 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse30 (let ((.cse32 (* (- 1) c_~N~0))) (let ((.cse31 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse32)))) (store .cse31 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse32)))))) (store .cse30 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (* (- 1) c_~N~0))) (let ((.cse34 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse35)))) (store .cse34 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse35))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse33 0) (not (= (mod .cse33 c_~N~0) 0)))))) (forall ((v_subst_5 Int)) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse41 (* (- 1) c_~N~0))) (let ((.cse40 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse41)))) (store .cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse41))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse36 c_~N~0) 0) (not (< .cse36 0)) (forall ((v_subst_1 Int)) (= 0 (select (let ((.cse38 (* (- 1) c_~N~0))) (let ((.cse37 (let ((.cse39 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse38)))) (store .cse39 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse38))))) (store .cse37 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse38)))) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not .cse42)) (or (and (not .cse29) .cse42) (and (forall ((v_subst_8 Int)) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse47 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse43 0)) (= (mod .cse43 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse45 (* (- 1) c_~N~0))) (let ((.cse44 (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse45)))) (store .cse46 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse44 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse45)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse48 (let ((.cse49 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse49 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse48 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse51 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse50 c_~N~0) 0)) (< .cse50 0)))))))))) .cse28) (or (forall ((v_subst_6 Int) (v_subst_2 Int)) (= (select (let ((.cse53 (let ((.cse54 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse54 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))))) (store .cse53 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4))))))) is different from false [2022-07-19 10:34:53,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:34:53,230 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:34:53,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 1 [2022-07-19 10:34:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 10:34:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980877788] [2022-07-19 10:34:53,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:34:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308476929] [2022-07-19 10:34:53,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308476929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:53,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:34:53,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-07-19 10:34:53,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26059023] [2022-07-19 10:34:53,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:53,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-19 10:34:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-19 10:34:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=536, Unknown=4, NotChecked=150, Total=812 [2022-07-19 10:34:53,240 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 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) [2022-07-19 10:35:01,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (< c_~N~0 0)) (.cse9 (mod .cse17 c_~N~0))) (let ((.cse0 (= .cse9 0)) (.cse1 (< .cse17 0)) (.cse8 (not .cse6)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse0) .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse3 c_~N~0) 0)) (< .cse3 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse4 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse4 0)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (= (select (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse8))) (< 2 c_~N~0) (= .cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse0 (not .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse11 c_~N~0) 0)) (< .cse11 0))) (forall ((v_subst_3 Int)) (= (select (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse12 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse13 0)) (forall ((v_subst_1 Int)) (= (select (let ((.cse15 (* (- 1) c_~N~0))) (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse15)))) (store .cse14 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse15)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse13 c_~N~0) 0))))) .cse6) (or .cse8 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse16 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse17 3) (= (select .cse10 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) is different from false [2022-07-19 10:35:03,480 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (< c_~N~0 0)) (.cse9 (mod .cse16 c_~N~0))) (let ((.cse0 (= .cse9 0)) (.cse1 (< .cse16 0)) (.cse8 (not .cse6))) (and (or (and (not .cse0) .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse3 c_~N~0) 0)) (< .cse3 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse4 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse4 0)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (= (select (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse8))) (< 2 c_~N~0) (= .cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse0 (not .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse10 c_~N~0) 0)) (< .cse10 0))) (forall ((v_subst_3 Int)) (= (select (let ((.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse11 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse12 0)) (forall ((v_subst_1 Int)) (= (select (let ((.cse14 (* (- 1) c_~N~0))) (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse14)))) (store .cse13 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse14)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse12 c_~N~0) 0))))) .cse6) (or .cse8 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse15 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse16 3))))) is different from false [2022-07-19 10:35:05,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse57 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (< c_~N~0 0)) (.cse29 (mod .cse57 c_~N~0))) (let ((.cse2 (= .cse29 0)) (.cse3 (< .cse57 0)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse28 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (not .cse30))) (and (forall ((v_subst_7 Int) (v_subst_3 Int)) (= (select (let ((.cse0 (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse1 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse0 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (or (and (not .cse2) .cse3) (and (or (forall ((v_subst_7 Int) (v_subst_3 Int)) (= (select (let ((.cse4 (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse4 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse6) (or (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse27 .cse28 .cse29)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (= (mod .cse26 c_~N~0) 0)) (.cse16 (< .cse26 0))) (and (or (and (forall ((v_subst_4 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse7 (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse8 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse10 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse9 0) (not (= (mod .cse9 c_~N~0) 0)))))) (forall ((v_subst_5 Int)) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse15 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_subst_1 Int)) (= (select (let ((.cse12 (* (- 1) c_~N~0))) (let ((.cse11 (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse12))))) (store .cse11 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse12)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse14 c_~N~0) 0) (not (< .cse14 0)))))) (not .cse16) .cse17) (or (and (not .cse17) .cse16) (and (forall ((v_subst_9 Int)) (or (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse19 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse18 0) (not (= (mod .cse18 c_~N~0) 0)))) (forall ((v_subst_3 Int)) (= (select (let ((.cse20 (let ((.cse21 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse21 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse20 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_subst_8 Int)) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse25 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse22 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse23 (let ((.cse24 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse24 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse23 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse22 0)))))))))) .cse30))) (or .cse2 (not .cse3) (and (or (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse27 .cse28 (+ .cse29 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (= (mod .cse54 c_~N~0) 0)) (.cse44 (< .cse54 0))) (and (or .cse31 (and (forall ((v_subst_4 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse32 (let ((.cse34 (* (- 1) c_~N~0))) (let ((.cse33 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse34)))) (store .cse33 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse34)))))) (store .cse32 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse37 (* (- 1) c_~N~0))) (let ((.cse36 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse37)))) (store .cse36 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse37))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse35 0) (not (= (mod .cse35 c_~N~0) 0)))))) (forall ((v_subst_5 Int)) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (* (- 1) c_~N~0))) (let ((.cse42 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse43)))) (store .cse42 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse43))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse38 c_~N~0) 0) (not (< .cse38 0)) (forall ((v_subst_1 Int)) (= 0 (select (let ((.cse40 (* (- 1) c_~N~0))) (let ((.cse39 (let ((.cse41 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))) (store .cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40))))) (store .cse39 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse40)))) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not .cse44)) (or (and (not .cse31) .cse44) (and (forall ((v_subst_8 Int)) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse49 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse45 0)) (= (mod .cse45 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse47 (* (- 1) c_~N~0))) (let ((.cse46 (let ((.cse48 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47)))) (store .cse48 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse46 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse47)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse50 (let ((.cse51 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse51 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse50 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse53 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse53 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse52 c_~N~0) 0)) (< .cse52 0)))))))))) .cse30) (or (forall ((v_subst_6 Int) (v_subst_2 Int)) (= (select (let ((.cse55 (let ((.cse56 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse56 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))))) (store .cse55 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse6))))))) is different from false [2022-07-19 10:35:07,768 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (< c_~N~0 0)) (.cse0 (mod .cse1 c_~N~0))) (let ((.cse4 (= .cse0 0)) (.cse5 (< .cse1 0)) (.cse2 (not .cse3))) (and (< 2 c_~N~0) (= .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 3) (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse3)) .cse4 (not .cse5)) (or (and (not .cse4) .cse5) (let ((.cse6 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse2 .cse6) (or .cse6 .cse3)))))))) is different from false [2022-07-19 10:35:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:35:09,942 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-19 10:35:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 10:35:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 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 24 [2022-07-19 10:35:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:35:09,943 INFO L225 Difference]: With dead ends: 91 [2022-07-19 10:35:09,943 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 10:35:09,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=251, Invalid=1029, Unknown=8, NotChecked=518, Total=1806 [2022-07-19 10:35:09,944 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:35:09,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 157 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 177 Invalid, 0 Unknown, 316 Unchecked, 1.0s Time] [2022-07-19 10:35:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 10:35:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-07-19 10:35:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 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) [2022-07-19 10:35:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-07-19 10:35:09,959 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 24 [2022-07-19 10:35:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:35:09,960 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-19 10:35:09,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 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) [2022-07-19 10:35:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-07-19 10:35:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:35:09,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:35:09,961 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:35:09,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:35:10,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:10,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:35:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:35:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1501136494, now seen corresponding path program 7 times [2022-07-19 10:35:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:35:10,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119533864] [2022-07-19 10:35:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:35:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:35:10,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:35:10,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253969889] [2022-07-19 10:35:10,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:35:10,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:10,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:35:10,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:35:10,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:35:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:35:10,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:35:10,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:35:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:10,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:35:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:35:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119533864] [2022-07-19 10:35:11,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:35:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253969889] [2022-07-19 10:35:11,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253969889] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:35:11,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:35:11,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:35:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236488731] [2022-07-19 10:35:11,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:35:11,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:35:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:35:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:35:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:35:11,332 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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) [2022-07-19 10:35:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:35:13,003 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-07-19 10:35:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:35:13,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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 [2022-07-19 10:35:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:35:13,004 INFO L225 Difference]: With dead ends: 100 [2022-07-19 10:35:13,004 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 10:35:13,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:35:13,005 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 129 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:35:13,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 91 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 10:35:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 10:35:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2022-07-19 10:35:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 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) [2022-07-19 10:35:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-19 10:35:13,017 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 24 [2022-07-19 10:35:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:35:13,017 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-19 10:35:13,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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) [2022-07-19 10:35:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-19 10:35:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:35:13,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:35:13,018 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:35:13,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 10:35:13,223 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,SelfDestructingSolverStorable9 [2022-07-19 10:35:13,224 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:35:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:35:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 778799246, now seen corresponding path program 8 times [2022-07-19 10:35:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:35:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100606400] [2022-07-19 10:35:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:35:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:35:13,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:35:13,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074262349] [2022-07-19 10:35:13,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:35:13,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:35:13,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:35:13,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:35:13,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:35:13,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:35:13,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-19 10:35:13,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:35:13,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:35:13,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:35:13,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:35:14,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:35:14,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 10:35:14,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-19 10:35:15,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-19 10:35:16,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:16,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-07-19 10:35:16,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:16,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-07-19 10:35:16,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:16,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-07-19 10:35:17,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-19 10:35:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:17,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:35:20,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (forall ((v_ArrVal_372 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-19 10:35:22,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (forall ((v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))))) is different from false [2022-07-19 10:35:24,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (v_ArrVal_369 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (= 0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))) is different from false [2022-07-19 10:35:26,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (v_ArrVal_369 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_111| 4)) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_111| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))))) is different from false [2022-07-19 10:36:40,342 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:36:40,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2022-07-19 10:36:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-19 10:36:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:36:40,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100606400] [2022-07-19 10:36:40,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:36:40,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074262349] [2022-07-19 10:36:40,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074262349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:36:40,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:36:40,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-19 10:36:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703190643] [2022-07-19 10:36:40,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:36:40,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 10:36:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:36:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 10:36:40,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1065, Unknown=24, NotChecked=284, Total=1560 [2022-07-19 10:36:40,352 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 40 states, 40 states have (on average 1.325) internal successors, (53), 40 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) [2022-07-19 10:37:13,468 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)