./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s22if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/s22if.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 0a4adccbfdb287a751e5c33c3e59569f71741de562bf1a42797adb485c4a44d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:52:41,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:52:41,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:52:41,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:52:41,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:52:41,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:52:41,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:52:41,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:52:41,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:52:41,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:52:41,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:52:41,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:52:41,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:52:41,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:52:41,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:52:41,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:52:41,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:52:41,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:52:41,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:52:41,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:52:41,558 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:52:41,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:52:41,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:52:41,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:52:41,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:52:41,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:52:41,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:52:41,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:52:41,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:52:41,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:52:41,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:52:41,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:52:41,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:52:41,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:52:41,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:52:41,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:52:41,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:52:41,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:52:41,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:52:41,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:52:41,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:52:41,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:52:41,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:52:41,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:52:41,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:52:41,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:52:41,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:52:41,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:52:41,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:52:41,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:52:41,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:52:41,605 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:52:41,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:52:41,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:52:41,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:52:41,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:52:41,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:52:41,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:52:41,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:52:41,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:52:41,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:52:41,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:52:41,609 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:52:41,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:52:41,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:52:41,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:52:41,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:52:41,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:52:41,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:52:41,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:52:41,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:52:41,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:52:41,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:52:41,611 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:52:41,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:52:41,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:52:41,612 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 -> 0a4adccbfdb287a751e5c33c3e59569f71741de562bf1a42797adb485c4a44d2 [2022-07-22 10:52:41,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:52:41,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:52:41,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:52:41,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:52:41,871 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:52:41,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s22if.c [2022-07-22 10:52:41,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e221a09ad/1b8899a7d8c44d809ab0aa397640c4db/FLAG743418641 [2022-07-22 10:52:42,310 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:52:42,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22if.c [2022-07-22 10:52:42,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e221a09ad/1b8899a7d8c44d809ab0aa397640c4db/FLAG743418641 [2022-07-22 10:52:42,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e221a09ad/1b8899a7d8c44d809ab0aa397640c4db [2022-07-22 10:52:42,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:52:42,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:52:42,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:52:42,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:52:42,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:52:42,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642382b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42, skipping insertion in model container [2022-07-22 10:52:42,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:52:42,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:52:42,539 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/s22if.c[588,601] [2022-07-22 10:52:42,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:52:42,575 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:52:42,587 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/s22if.c[588,601] [2022-07-22 10:52:42,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:52:42,620 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:52:42,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42 WrapperNode [2022-07-22 10:52:42,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:52:42,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:52:42,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:52:42,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:52:42,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,665 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2022-07-22 10:52:42,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:52:42,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:52:42,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:52:42,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:52:42,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:52:42,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:52:42,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:52:42,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:52:42,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (1/1) ... [2022-07-22 10:52:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:52:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:42,751 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-22 10:52:42,759 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-22 10:52:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:52:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:52:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:52:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:52:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:52:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:52:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:52:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:52:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:52:42,857 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:52:42,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:52:43,039 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:52:43,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:52:43,059 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:52:43,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:52:43 BoogieIcfgContainer [2022-07-22 10:52:43,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:52:43,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:52:43,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:52:43,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:52:43,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:52:42" (1/3) ... [2022-07-22 10:52:43,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e03faba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:52:43, skipping insertion in model container [2022-07-22 10:52:43,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:42" (2/3) ... [2022-07-22 10:52:43,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e03faba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:52:43, skipping insertion in model container [2022-07-22 10:52:43,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:52:43" (3/3) ... [2022-07-22 10:52:43,068 INFO L111 eAbstractionObserver]: Analyzing ICFG s22if.c [2022-07-22 10:52:43,096 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:52:43,096 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:52:43,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:52:43,144 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@6c17277c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56e64455 [2022-07-22 10:52:43,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:52:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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-22 10:52:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 10:52:43,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:43,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:43,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2022-07-22 10:52:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:43,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680955689] [2022-07-22 10:52:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:43,318 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-22 10:52:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:43,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680955689] [2022-07-22 10:52:43,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680955689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:52:43,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:52:43,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:52:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131043491] [2022-07-22 10:52:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:52:43,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:52:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:52:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:52:43,356 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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.5) internal successors, (13), 2 states have internal predecessors, (13), 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-22 10:52:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:43,368 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-22 10:52:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:52:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-22 10:52:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:43,377 INFO L225 Difference]: With dead ends: 42 [2022-07-22 10:52:43,377 INFO L226 Difference]: Without dead ends: 19 [2022-07-22 10:52:43,380 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-22 10:52:43,385 INFO L413 NwaCegarLoop]: 28 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, 28 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-22 10:52:43,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:52:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-22 10:52:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 10:52:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-22 10:52:43,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2022-07-22 10:52:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:43,408 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 10:52:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-22 10:52:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-22 10:52:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 10:52:43,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:43,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:43,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:52:43,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2022-07-22 10:52:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:43,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845838562] [2022-07-22 10:52:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:43,490 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-22 10:52:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:43,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845838562] [2022-07-22 10:52:43,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845838562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:52:43,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:52:43,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:52:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865882195] [2022-07-22 10:52:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:52:43,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:52:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:52:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:52:43,493 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-22 10:52:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:43,570 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-07-22 10:52:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:52:43,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-22 10:52:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:43,572 INFO L225 Difference]: With dead ends: 39 [2022-07-22 10:52:43,572 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 10:52:43,576 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-22 10:52:43,578 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:43,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 10:52:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-22 10:52:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 10:52:43,592 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-22 10:52:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:43,594 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 10:52:43,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-22 10:52:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 10:52:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:52:43,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:43,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:43,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:52:43,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2022-07-22 10:52:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:43,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978125630] [2022-07-22 10:52:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978125630] [2022-07-22 10:52:43,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978125630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:43,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112734883] [2022-07-22 10:52:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:43,887 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-22 10:52:43,892 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-22 10:52:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:43,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 10:52:43,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:44,047 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-22 10:52:44,059 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-22 10:52:44,088 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 14 treesize of output 16 [2022-07-22 10:52:44,141 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 14 treesize of output 16 [2022-07-22 10:52:44,212 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-22 10:52:44,330 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 47 treesize of output 27 [2022-07-22 10:52:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:44,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:44,549 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse0 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (<= (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (* c_~N~0 3)) (not (= .cse0 3))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse1 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= .cse1 3)) (<= (* c_~N~0 3) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2022-07-22 10:52:44,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:52:44,822 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 79 treesize of output 72 [2022-07-22 10:52:44,826 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-22 10:52:44,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:44,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 66 treesize of output 54 [2022-07-22 10:52:44,850 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 22 treesize of output 10 [2022-07-22 10:52:44,855 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 22 treesize of output 10 [2022-07-22 10:52:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 10:52:44,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112734883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:44,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:44,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-07-22 10:52:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966581815] [2022-07-22 10:52:44,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:52:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:52:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2022-07-22 10:52:44,872 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:45,206 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-22 10:52:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:52:45,206 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 10:52:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:45,208 INFO L225 Difference]: With dead ends: 41 [2022-07-22 10:52:45,208 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 10:52:45,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=418, Unknown=1, NotChecked=44, Total=600 [2022-07-22 10:52:45,211 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:45,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 61 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-07-22 10:52:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 10:52:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-22 10:52:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-22 10:52:45,220 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-22 10:52:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:45,222 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-22 10:52:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-22 10:52:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:52:45,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:45,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:45,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 10:52:45,439 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-22 10:52:45,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2022-07-22 10:52:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:45,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341466975] [2022-07-22 10:52:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:45,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:52:45,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494072572] [2022-07-22 10:52:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:45,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:45,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:45,474 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-22 10:52:45,475 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-22 10:52:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:45,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 10:52:45,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:45,565 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-22 10:52:45,598 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 15 treesize of output 7 [2022-07-22 10:52:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:45,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:45,647 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 37 treesize of output 31 [2022-07-22 10:52:45,652 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 10:52:45,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-07-22 10:52:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:45,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:45,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341466975] [2022-07-22 10:52:45,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:52:45,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494072572] [2022-07-22 10:52:45,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494072572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:45,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:52:45,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-07-22 10:52:45,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635036383] [2022-07-22 10:52:45,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:45,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 10:52:45,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:45,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 10:52:45,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:52:45,666 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-22 10:52:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:45,821 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-22 10:52:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 10:52:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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) Word has length 21 [2022-07-22 10:52:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:45,824 INFO L225 Difference]: With dead ends: 58 [2022-07-22 10:52:45,824 INFO L226 Difference]: Without dead ends: 51 [2022-07-22 10:52:45,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:52:45,825 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:45,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-22 10:52:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2022-07-22 10:52:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 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-22 10:52:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-22 10:52:45,832 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2022-07-22 10:52:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:45,832 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-22 10:52:45,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-22 10:52:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-07-22 10:52:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:52:45,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:45,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:45,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:46,051 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-22 10:52:46,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2022-07-22 10:52:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:46,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796347668] [2022-07-22 10:52:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:46,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:46,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796347668] [2022-07-22 10:52:46,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796347668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:46,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004641936] [2022-07-22 10:52:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:46,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:46,245 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-22 10:52:46,254 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-22 10:52:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:46,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 10:52:46,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:46,321 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-22 10:52:46,356 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 15 treesize of output 7 [2022-07-22 10:52:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:46,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:46,397 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 14 treesize of output 12 [2022-07-22 10:52:46,399 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 22 treesize of output 20 [2022-07-22 10:52:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:46,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004641936] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:46,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:46,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-22 10:52:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749494378] [2022-07-22 10:52:46,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:46,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:52:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:52:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:52:46,425 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:47,025 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-07-22 10:52:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 10:52:47,025 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 10:52:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:47,026 INFO L225 Difference]: With dead ends: 86 [2022-07-22 10:52:47,026 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 10:52:47,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 10:52:47,027 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:47,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:52:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 10:52:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-07-22 10:52:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 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-22 10:52:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-22 10:52:47,035 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2022-07-22 10:52:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:47,035 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-22 10:52:47,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-22 10:52:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 10:52:47,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:47,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:47,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:47,251 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-22 10:52:47,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2022-07-22 10:52:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101784857] [2022-07-22 10:52:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:47,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:47,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101784857] [2022-07-22 10:52:47,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101784857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:47,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646644401] [2022-07-22 10:52:47,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:52:47,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:47,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:47,345 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-22 10:52:47,347 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-22 10:52:47,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:52:47,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:47,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:52:47,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:47,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:47,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646644401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:47,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:47,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:52:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541470597] [2022-07-22 10:52:47,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:47,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:52:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:52:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:52:47,495 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:47,655 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-07-22 10:52:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:52:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 10:52:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:47,657 INFO L225 Difference]: With dead ends: 85 [2022-07-22 10:52:47,657 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 10:52:47,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:52:47,658 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:47,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 26 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 10:52:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-07-22 10:52:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 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-22 10:52:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-07-22 10:52:47,669 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2022-07-22 10:52:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:47,669 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-07-22 10:52:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-07-22 10:52:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:52:47,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:47,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:47,694 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-22 10:52:47,891 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-22 10:52:47,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2022-07-22 10:52:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:47,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703393640] [2022-07-22 10:52:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:47,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703393640] [2022-07-22 10:52:47,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703393640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:47,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199528452] [2022-07-22 10:52:47,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:52:47,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:47,952 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-22 10:52:47,962 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-22 10:52:48,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:52:48,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:48,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:52:48,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:48,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:48,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199528452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:48,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:48,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:52:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210480718] [2022-07-22 10:52:48,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:48,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:52:48,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:52:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:52:48,101 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-22 10:52:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:48,202 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-07-22 10:52:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:52:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-22 10:52:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:48,203 INFO L225 Difference]: With dead ends: 78 [2022-07-22 10:52:48,203 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 10:52:48,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:52:48,204 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:48,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 10:52:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-07-22 10:52:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 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-22 10:52:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-22 10:52:48,210 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2022-07-22 10:52:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:48,210 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-22 10:52:48,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-22 10:52:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-22 10:52:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:52:48,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:48,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:48,238 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-22 10:52:48,431 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-22 10:52:48,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2022-07-22 10:52:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:48,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900759095] [2022-07-22 10:52:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:52:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:48,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900759095] [2022-07-22 10:52:48,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900759095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:48,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925825060] [2022-07-22 10:52:48,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:52:48,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:48,765 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-22 10:52:48,791 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-22 10:52:48,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:52:48,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:48,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:52:48,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:48,841 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-22 10:52:48,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:48,869 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 14 treesize of output 16 [2022-07-22 10:52:48,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:48,911 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 14 treesize of output 16 [2022-07-22 10:52:49,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:49,023 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 14 treesize of output 16 [2022-07-22 10:52:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:49,056 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 14 treesize of output 16 [2022-07-22 10:52:49,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:49,125 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-22 10:52:49,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:49,250 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:52:49,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-22 10:52:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:49,347 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:52:49,348 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 68 treesize of output 32 [2022-07-22 10:52:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:49,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:49,779 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int))) (or (forall ((v_subst_1 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (<= (* c_~N~0 3) (+ .cse0 .cse1 .cse2)) (not (= .cse0 3)))))))) (not (= 3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int))) (or (forall ((v_subst_2 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 3 .cse5)) (<= (+ .cse6 .cse7 .cse5) (* c_~N~0 3)))))))) (not (= 3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) is different from false [2022-07-22 10:52:50,638 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int))) (or (forall ((v_subst_1 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (<= (* 3 ~N~0) (+ .cse0 .cse1 .cse2)) (not (= .cse0 3)))))))) (not (= 3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int))) (or (forall ((v_subst_2 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 3 .cse5)) (<= (+ .cse6 .cse7 .cse5) (* 3 ~N~0)))))))) (not (= 3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:52:50,717 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (v_subst_3 Int)) (or (forall ((v_subst_2 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3)))) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (<= (+ .cse0 .cse1 .cse2) (* 3 ~N~0)) (not (= .cse0 3)))))))) (not (= (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))) 3)))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (v_subst_4 Int)) (or (not (= 3 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (forall ((v_subst_1 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= 3 .cse5)) (<= (* 3 ~N~0) (+ .cse6 .cse5 .cse7)))))))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))))) is different from false [2022-07-22 10:52:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-07-22 10:52:50,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925825060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:50,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:50,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2022-07-22 10:52:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182161595] [2022-07-22 10:52:50,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:50,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 10:52:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 10:52:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2022-07-22 10:52:50,826 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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-22 10:52:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:51,703 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-07-22 10:52:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 10:52:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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 29 [2022-07-22 10:52:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:51,704 INFO L225 Difference]: With dead ends: 83 [2022-07-22 10:52:51,705 INFO L226 Difference]: Without dead ends: 78 [2022-07-22 10:52:51,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=274, Invalid=1457, Unknown=3, NotChecked=246, Total=1980 [2022-07-22 10:52:51,706 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:51,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 119 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 331 Invalid, 0 Unknown, 430 Unchecked, 0.2s Time] [2022-07-22 10:52:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-22 10:52:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-07-22 10:52:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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-22 10:52:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-07-22 10:52:51,716 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2022-07-22 10:52:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:51,717 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-07-22 10:52:51,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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-22 10:52:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-07-22 10:52:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:52:51,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:51,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:51,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:51,931 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-22 10:52:51,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2022-07-22 10:52:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:51,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846060290] [2022-07-22 10:52:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:51,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:52:51,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924461827] [2022-07-22 10:52:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:51,955 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-22 10:52:51,957 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-22 10:52:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:52,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 10:52:52,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:52,071 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 31 treesize of output 15 [2022-07-22 10:52:52,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:52,118 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 16 treesize of output 18 [2022-07-22 10:52:52,142 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 19 treesize of output 7 [2022-07-22 10:52:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:52:52,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:52,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-22 10:52:52,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-22 10:52:52,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:52:52,224 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-07-22 10:52:52,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:52:52,230 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 38 [2022-07-22 10:52:52,235 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 11 treesize of output 7 [2022-07-22 10:52:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-07-22 10:52:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846060290] [2022-07-22 10:52:52,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:52:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924461827] [2022-07-22 10:52:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924461827] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:52,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:52:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-22 10:52:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685490436] [2022-07-22 10:52:52,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:52:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:52:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2022-07-22 10:52:52,295 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:52,513 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2022-07-22 10:52:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 10:52:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 10:52:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:52,514 INFO L225 Difference]: With dead ends: 112 [2022-07-22 10:52:52,514 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 10:52:52,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2022-07-22 10:52:52,515 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:52,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 86 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 225 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-07-22 10:52:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 10:52:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2022-07-22 10:52:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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-22 10:52:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-07-22 10:52:52,544 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 29 [2022-07-22 10:52:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:52,546 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-07-22 10:52:52,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-07-22 10:52:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:52:52,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:52,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:52,579 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-22 10:52:52,765 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-22 10:52:52,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2022-07-22 10:52:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:52,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781187655] [2022-07-22 10:52:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:52,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:52:52,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524757493] [2022-07-22 10:52:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:52,786 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-22 10:52:52,791 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-22 10:52:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:52,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 10:52:52,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:52,870 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 13 treesize of output 9 [2022-07-22 10:52:52,900 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:52:52,901 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 24 [2022-07-22 10:52:52,916 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 19 treesize of output 7 [2022-07-22 10:52:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:52,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:52,956 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 16 treesize of output 14 [2022-07-22 10:52:52,958 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 28 treesize of output 24 [2022-07-22 10:52:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:52,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781187655] [2022-07-22 10:52:52,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:52:52,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524757493] [2022-07-22 10:52:52,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524757493] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:52,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:52:52,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-22 10:52:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411389142] [2022-07-22 10:52:52,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 10:52:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 10:52:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 10:52:52,968 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-22 10:52:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:53,090 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2022-07-22 10:52:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 10:52:53,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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) Word has length 29 [2022-07-22 10:52:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:53,092 INFO L225 Difference]: With dead ends: 123 [2022-07-22 10:52:53,092 INFO L226 Difference]: Without dead ends: 91 [2022-07-22 10:52:53,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:52:53,093 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:53,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-22 10:52:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-07-22 10:52:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 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-22 10:52:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2022-07-22 10:52:53,102 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 29 [2022-07-22 10:52:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:53,103 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2022-07-22 10:52:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-22 10:52:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-07-22 10:52:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 10:52:53,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:53,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:53,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:53,315 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-22 10:52:53,316 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2022-07-22 10:52:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:53,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784730322] [2022-07-22 10:52:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784730322] [2022-07-22 10:52:53,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784730322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251530464] [2022-07-22 10:52:53,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:52:53,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:53,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:53,387 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-22 10:52:53,387 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-22 10:52:53,454 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:52:53,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:53,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:52:53,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:53,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:53,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251530464] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:53,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:53,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:52:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918676805] [2022-07-22 10:52:53,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:53,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:52:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:52:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:52:53,568 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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-22 10:52:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:53,810 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-07-22 10:52:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:52:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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 31 [2022-07-22 10:52:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:53,812 INFO L225 Difference]: With dead ends: 110 [2022-07-22 10:52:53,812 INFO L226 Difference]: Without dead ends: 97 [2022-07-22 10:52:53,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:52:53,813 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:53,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 34 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:52:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-22 10:52:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-07-22 10:52:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 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-22 10:52:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-07-22 10:52:53,822 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 31 [2022-07-22 10:52:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:53,823 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-07-22 10:52:53,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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-22 10:52:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-07-22 10:52:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:52:53,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:53,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:53,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 10:52:54,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:54,039 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2022-07-22 10:52:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:54,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649530706] [2022-07-22 10:52:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:54,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:54,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649530706] [2022-07-22 10:52:54,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649530706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623897970] [2022-07-22 10:52:54,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:52:54,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:54,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:54,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:54,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 10:52:54,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 10:52:54,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:54,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:52:54,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:54,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:54,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623897970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:54,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:54,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:52:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454824] [2022-07-22 10:52:54,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:54,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:52:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:54,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:52:54,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:52:54,289 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:54,421 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-07-22 10:52:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:52:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:52:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:54,421 INFO L225 Difference]: With dead ends: 101 [2022-07-22 10:52:54,422 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:52:54,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:52:54,422 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:54,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 27 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:52:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-22 10:52:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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-22 10:52:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-22 10:52:54,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2022-07-22 10:52:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:54,427 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-22 10:52:54,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-22 10:52:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 10:52:54,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:54,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:54,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-22 10:52:54,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 10:52:54,643 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2022-07-22 10:52:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:54,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091649380] [2022-07-22 10:52:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:52:55,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:55,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091649380] [2022-07-22 10:52:55,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091649380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:55,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116458870] [2022-07-22 10:52:55,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:52:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:55,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:55,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 10:52:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:55,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-22 10:52:55,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:55,118 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-22 10:52:55,123 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-22 10:52:55,131 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 14 treesize of output 16 [2022-07-22 10:52:55,152 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 14 treesize of output 16 [2022-07-22 10:52:55,166 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 14 treesize of output 16 [2022-07-22 10:52:55,228 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 14 treesize of output 16 [2022-07-22 10:52:55,248 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 14 treesize of output 16 [2022-07-22 10:52:55,271 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 14 treesize of output 16 [2022-07-22 10:52:55,330 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-22 10:52:55,444 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:52:55,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-07-22 10:52:55,554 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:52:55,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-22 10:52:55,649 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:52:55,649 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 70 treesize of output 34 [2022-07-22 10:52:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:52:55,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:03,893 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (or (not (= (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 3)) (forall ((v_subst_8 Int)) (or (not (= 3 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (forall ((v_subst_5 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (not (= 3 .cse2)) (<= (* c_~N~0 3) (+ .cse3 .cse4 .cse5 .cse2))))))))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (or (not (= (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 3)) (forall ((v_subst_7 Int)) (or (forall ((v_subst_6 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse11 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (not (= .cse8 3)) (<= (+ .cse9 .cse8 .cse10 .cse11) (* c_~N~0 3))))))))) (not (= 3 (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7)))))))))) is different from false [2022-07-22 10:53:04,891 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (or (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (not (= 3 .cse0)) (<= (* 3 ~N~0) (+ .cse1 .cse2 .cse3 .cse0))))))))) (not (= 3 (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))))) (not (= (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 3)))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (or (forall ((v_subst_7 Int)) (or (forall ((v_subst_6 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse11 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (not (= .cse8 3)) (<= (+ .cse9 .cse8 .cse10 .cse11) (* 3 ~N~0))))))))) (not (= 3 (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))))) (not (= (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 3)))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:53:04,984 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_9 Int)) (or (forall ((v_subst_7 Int)) (or (forall ((v_subst_6 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9)))) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (<= (+ .cse0 .cse1 .cse2 .cse3) (* 3 ~N~0)) (not (= 3 .cse3))))))))) (not (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))) 3)))) (not (= 3 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))))))) (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_10 Int)) (or (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4)))) (.cse11 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (<= (* 3 ~N~0) (+ .cse8 .cse9 .cse10 .cse11)) (not (= .cse10 3))))))))) (not (= (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))) (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))) 3)))) (not (= (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))) 3))))))) is different from false [2022-07-22 10:53:05,126 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_10 Int)) (or (forall ((v_subst_8 Int)) (or (forall ((v_subst_5 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (<= (* 3 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (= .cse2 3))))))))) (not (= (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))) (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))) 3)))) (not (= (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))) 3)))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_9 Int)) (or (forall ((v_subst_7 Int)) (or (forall ((v_subst_6 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9)))) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (<= (+ .cse8 .cse9 .cse10 .cse11) (* 3 ~N~0)) (not (= 3 .cse11))))))))) (not (= (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))) (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))) 3)))) (not (= 3 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:53:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2022-07-22 10:53:05,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116458870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:05,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:05,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 38 [2022-07-22 10:53:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802406112] [2022-07-22 10:53:05,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:05,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-22 10:53:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-22 10:53:05,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1005, Unknown=8, NotChecked=268, Total=1406 [2022-07-22 10:53:05,248 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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-22 10:53:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:07,198 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-07-22 10:53:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 10:53:07,198 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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 37 [2022-07-22 10:53:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:07,199 INFO L225 Difference]: With dead ends: 94 [2022-07-22 10:53:07,199 INFO L226 Difference]: Without dead ends: 90 [2022-07-22 10:53:07,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=250, Invalid=1828, Unknown=8, NotChecked=364, Total=2450 [2022-07-22 10:53:07,200 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 606 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:07,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 123 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 356 Invalid, 0 Unknown, 606 Unchecked, 0.2s Time] [2022-07-22 10:53:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-22 10:53:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2022-07-22 10:53:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 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-22 10:53:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-07-22 10:53:07,208 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2022-07-22 10:53:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:07,209 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-07-22 10:53:07,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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-22 10:53:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-07-22 10:53:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 10:53:07,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:07,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:07,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 10:53:07,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 10:53:07,419 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:07,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:07,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2022-07-22 10:53:07,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:07,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225847154] [2022-07-22 10:53:07,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:07,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:53:07,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29899317] [2022-07-22 10:53:07,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:53:07,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:07,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:07,434 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:53:07,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 10:53:07,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:53:07,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:07,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 10:53:07,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:07,657 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 31 treesize of output 15 [2022-07-22 10:53:07,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:07,719 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 16 treesize of output 18 [2022-07-22 10:53:07,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:07,752 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 16 treesize of output 18 [2022-07-22 10:53:07,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:53:07,788 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 21 treesize of output 21 [2022-07-22 10:53:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:53:07,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:07,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) c_~N~0) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-22 10:53:07,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_498 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) c_~N~0) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_147|))) is different from false [2022-07-22 10:53:08,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:53:08,186 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-07-22 10:53:08,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:53:08,195 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 44 treesize of output 44 [2022-07-22 10:53:08,199 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 13 treesize of output 7 [2022-07-22 10:53:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-22 10:53:08,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:08,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225847154] [2022-07-22 10:53:08,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:53:08,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29899317] [2022-07-22 10:53:08,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29899317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:08,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:53:08,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-07-22 10:53:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188810819] [2022-07-22 10:53:08,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:08,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 10:53:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 10:53:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=796, Unknown=12, NotChecked=122, Total=1122 [2022-07-22 10:53:08,482 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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-22 10:53:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:08,968 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-22 10:53:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 10:53:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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 37 [2022-07-22 10:53:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:08,969 INFO L225 Difference]: With dead ends: 106 [2022-07-22 10:53:08,970 INFO L226 Difference]: Without dead ends: 99 [2022-07-22 10:53:08,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1343, Unknown=13, NotChecked=162, Total=1892 [2022-07-22 10:53:08,970 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 136 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:08,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 47 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 345 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-07-22 10:53:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-22 10:53:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2022-07-22 10:53:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 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-22 10:53:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-22 10:53:08,979 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 37 [2022-07-22 10:53:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:08,980 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-22 10:53:08,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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-22 10:53:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-22 10:53:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 10:53:08,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:08,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:08,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-22 10:53:09,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 10:53:09,187 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2022-07-22 10:53:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:09,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883124637] [2022-07-22 10:53:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:09,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:53:09,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643392343] [2022-07-22 10:53:09,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:53:09,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:09,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:09,203 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:53:09,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 10:53:09,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:53:09,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:09,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 10:53:09,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:09,334 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 37 treesize of output 17 [2022-07-22 10:53:09,385 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-22 10:53:09,385 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 30 treesize of output 29 [2022-07-22 10:53:09,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:09,457 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 21 treesize of output 23 [2022-07-22 10:53:09,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:53:09,494 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 26 treesize of output 26 [2022-07-22 10:53:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 10:53:09,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:09,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< .cse0 c_~N~0) (< c_~N~0 .cse0)))) is different from false [2022-07-22 10:53:09,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_167|) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_167| 1)))) is different from false [2022-07-22 10:53:09,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_167| 1) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_167|) (= 3 (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-22 10:53:09,866 INFO L356 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-07-22 10:53:09,866 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2022-07-22 10:53:09,874 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-22 10:53:09,875 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 42 treesize of output 30 [2022-07-22 10:53:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2022-07-22 10:53:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:09,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883124637] [2022-07-22 10:53:09,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:53:09,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643392343] [2022-07-22 10:53:09,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643392343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:09,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:53:09,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2022-07-22 10:53:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407799907] [2022-07-22 10:53:09,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:09,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 10:53:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:09,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 10:53:09,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=12, NotChecked=120, Total=552 [2022-07-22 10:53:09,905 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 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-22 10:53:10,671 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 2) (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|))) 1) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_167| 1) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_167|) (= 3 (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-07-22 10:53:12,680 WARN L833 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_167|) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_167| 1))))) is different from false [2022-07-22 10:53:13,370 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 2) (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (= (+ (- 2) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_167| 1) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_167|) (= 3 (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-07-22 10:53:14,051 WARN L833 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~i~0#1_167| Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_167|) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_167| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_167| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (and (= (+ (- 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_159| 1)) (< |v_ULTIMATE.start_main_~i~0#1_159| c_~N~0)))) is different from false [2022-07-22 10:53:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:14,192 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2022-07-22 10:53:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 10:53:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 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) Word has length 37 [2022-07-22 10:53:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:14,193 INFO L225 Difference]: With dead ends: 121 [2022-07-22 10:53:14,193 INFO L226 Difference]: Without dead ends: 117 [2022-07-22 10:53:14,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=157, Invalid=611, Unknown=16, NotChecked=406, Total=1190 [2022-07-22 10:53:14,194 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:14,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 144 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2022-07-22 10:53:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-22 10:53:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-07-22 10:53:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 102 states have internal predecessors, (128), 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-22 10:53:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-07-22 10:53:14,210 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 37 [2022-07-22 10:53:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:14,210 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-07-22 10:53:14,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 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-22 10:53:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-07-22 10:53:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 10:53:14,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:14,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:14,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 10:53:14,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 10:53:14,434 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash -204568597, now seen corresponding path program 1 times [2022-07-22 10:53:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:14,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831108053] [2022-07-22 10:53:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:53:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831108053] [2022-07-22 10:53:14,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831108053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072711793] [2022-07-22 10:53:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:14,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:14,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:14,848 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:53:14,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 10:53:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:14,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 10:53:14,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:14,986 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 13 treesize of output 9 [2022-07-22 10:53:15,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:15,044 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 24 [2022-07-22 10:53:15,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:15,081 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 24 [2022-07-22 10:53:15,117 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 15 treesize of output 7 [2022-07-22 10:53:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:15,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:15,258 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 16 treesize of output 14 [2022-07-22 10:53:15,260 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 28 treesize of output 24 [2022-07-22 10:53:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:15,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072711793] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:15,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:15,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 34 [2022-07-22 10:53:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173039774] [2022-07-22 10:53:15,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:15,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 10:53:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 10:53:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 10:53:15,331 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 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-22 10:53:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:17,046 INFO L93 Difference]: Finished difference Result 211 states and 268 transitions. [2022-07-22 10:53:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-22 10:53:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 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 37 [2022-07-22 10:53:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:17,047 INFO L225 Difference]: With dead ends: 211 [2022-07-22 10:53:17,047 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 10:53:17,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=534, Invalid=5016, Unknown=0, NotChecked=0, Total=5550 [2022-07-22 10:53:17,050 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:17,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 228 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 10:53:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 10:53:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2022-07-22 10:53:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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-22 10:53:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2022-07-22 10:53:17,071 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 37 [2022-07-22 10:53:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:17,071 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2022-07-22 10:53:17,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 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-22 10:53:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2022-07-22 10:53:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 10:53:17,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:17,073 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:17,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 10:53:17,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:17,279 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2022-07-22 10:53:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:17,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556294485] [2022-07-22 10:53:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:17,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556294485] [2022-07-22 10:53:17,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556294485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58614578] [2022-07-22 10:53:17,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:53:17,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:17,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:17,384 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:53:17,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 10:53:17,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:53:17,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:17,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:53:17,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:17,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:17,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58614578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:17,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:17,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:53:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087561453] [2022-07-22 10:53:17,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:53:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:17,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:53:17,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:53:17,566 INFO L87 Difference]: Start difference. First operand 137 states and 175 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:17,834 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-07-22 10:53:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:53:17,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-22 10:53:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:17,836 INFO L225 Difference]: With dead ends: 182 [2022-07-22 10:53:17,836 INFO L226 Difference]: Without dead ends: 161 [2022-07-22 10:53:17,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:53:17,837 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:17,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 31 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:53:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-22 10:53:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2022-07-22 10:53:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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-22 10:53:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2022-07-22 10:53:17,853 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2022-07-22 10:53:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:17,853 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-07-22 10:53:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-07-22 10:53:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 10:53:17,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:17,854 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:17,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 10:53:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 10:53:18,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2022-07-22 10:53:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:18,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950830951] [2022-07-22 10:53:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950830951] [2022-07-22 10:53:18,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950830951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080604309] [2022-07-22 10:53:18,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:53:18,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:18,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:18,140 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:53:18,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 10:53:18,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 10:53:18,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:18,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:53:18,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:18,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:53:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080604309] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:18,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:18,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:53:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782363445] [2022-07-22 10:53:18,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:53:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:53:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:53:18,357 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-22 10:53:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:18,529 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-07-22 10:53:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 10:53:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 40 [2022-07-22 10:53:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:18,530 INFO L225 Difference]: With dead ends: 131 [2022-07-22 10:53:18,530 INFO L226 Difference]: Without dead ends: 58 [2022-07-22 10:53:18,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-22 10:53:18,531 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:18,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 33 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:53:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-22 10:53:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-22 10:53:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-22 10:53:18,537 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2022-07-22 10:53:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:18,537 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-22 10:53:18,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-22 10:53:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-22 10:53:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 10:53:18,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:18,537 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:18,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 10:53:18,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 10:53:18,738 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2022-07-22 10:53:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:18,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483701248] [2022-07-22 10:53:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 10:53:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:19,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483701248] [2022-07-22 10:53:19,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483701248] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:19,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677862974] [2022-07-22 10:53:19,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:53:19,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:19,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:19,239 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:53:19,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 10:53:19,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:53:19,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:19,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-22 10:53:19,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:19,320 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-22 10:53:19,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,351 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 14 treesize of output 16 [2022-07-22 10:53:19,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,395 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 14 treesize of output 16 [2022-07-22 10:53:19,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,434 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 14 treesize of output 16 [2022-07-22 10:53:19,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,475 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 14 treesize of output 16 [2022-07-22 10:53:19,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,595 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 14 treesize of output 16 [2022-07-22 10:53:19,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,613 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 14 treesize of output 16 [2022-07-22 10:53:19,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,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 14 treesize of output 16 [2022-07-22 10:53:19,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,659 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 14 treesize of output 16 [2022-07-22 10:53:19,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,726 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-22 10:53:19,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,852 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:53:19,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-07-22 10:53:19,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:19,998 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-22 10:53:19,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2022-07-22 10:53:20,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:20,175 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 10:53:20,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 83 [2022-07-22 10:53:20,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:53:20,322 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-22 10:53:20,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 52 [2022-07-22 10:53:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:53:20,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:44,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int))) (or (forall ((v_subst_16 Int)) (or (forall ((v_subst_14 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))) 3)) (forall ((v_subst_11 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse4 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (or (<= (+ .cse4 .cse5 .cse6 .cse7 .cse8) (* c_~N~0 3)) (not (= 3 .cse8)))))))))))) (not (= 3 (select (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))))) (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int))) (or (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (forall ((v_subst_15 Int)) (or (forall ((v_subst_13 Int)) (or (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .cse15 .cse16 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)) (forall ((v_subst_12 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse17 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (or (<= (* c_~N~0 3) (+ .cse17 .cse18 .cse19 .cse20 .cse21)) (not (= 3 .cse18)))))))))))) (not (= 3 (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4)))))))))) is different from false [2022-07-22 10:53:48,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int))) (or (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (forall ((v_subst_15 Int)) (or (not (= 3 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (forall ((v_subst_13 Int)) (or (forall ((v_subst_12 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (or (not (= 3 .cse2)) (<= (* 3 ~N~0) (+ .cse3 .cse2 .cse4 .cse5 .cse6)))))))))) (not (= (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .cse11 .cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int))) (or (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (forall ((v_subst_16 Int)) (or (forall ((v_subst_14 Int)) (or (forall ((v_subst_11 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse13 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (or (<= (+ .cse13 .cse14 .cse15 .cse16 .cse17) (* 3 ~N~0)) (not (= 3 .cse17)))))))))) (not (= (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) .cse22 .cse23)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))) 3)))) (not (= 3 (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:53:49,129 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (v_subst_18 Int)) (or (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (forall ((v_subst_15 Int)) (or (forall ((v_subst_13 Int)) (or (forall ((v_subst_12 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (or (<= (* 3 ~N~0) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 3 .cse2)))))))))) (not (= (select (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) .cse9 .cse10)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= 3 (select (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (v_subst_17 Int)) (or (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 3)) (forall ((v_subst_14 Int)) (or (forall ((v_subst_11 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))) (.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse17 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (or (<= (+ .cse15 .cse16 .cse17 .cse18 .cse19) (* 3 ~N~0)) (not (= 3 .cse18)))))))))) (not (= (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse24 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))) (.cse25 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) .cse24 .cse25)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))) 3)))))) (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))))))))) is different from false [2022-07-22 10:53:49,368 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (v_subst_17 Int)) (or (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 3)) (forall ((v_subst_14 Int)) (or (forall ((v_subst_11 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (or (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6) (* 3 ~N~0)) (not (= 3 .cse5)))))))))) (not (= (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))) (.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) .cse11 .cse12)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))) 3)))))) (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))))))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (v_subst_18 Int)) (or (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (forall ((v_subst_15 Int)) (or (forall ((v_subst_13 Int)) (or (forall ((v_subst_12 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse13 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (or (<= (* 3 ~N~0) (+ .cse13 .cse14 .cse15 .cse16 .cse17)) (not (= 3 .cse15)))))))))) (not (= (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) .cse22 .cse23)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= 3 (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:53:49,605 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (v_subst_17 Int)) (or (forall ((v_subst_16 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) 3)) (forall ((v_subst_14 Int)) (or (forall ((v_subst_11 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (or (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6) (* 3 ~N~0)) (not (= 3 .cse5)))))))))) (not (= (select (select (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4)))) (.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))) .cse11 .cse12)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))) 3)))))) (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_17 4))))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (v_subst_18 Int)) (or (not (= 3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (forall ((v_subst_15 Int)) (or (forall ((v_subst_13 Int)) (or (forall ((v_subst_12 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse13 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (or (<= (* 3 ~N~0) (+ .cse13 .cse14 .cse15 .cse16 .cse17)) (not (= 3 .cse15)))))))))) (not (= (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4))))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))) .cse22 .cse23)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= 3 (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_18 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:53:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2022-07-22 10:53:49,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677862974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:49,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:49,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 53 [2022-07-22 10:53:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2746587] [2022-07-22 10:53:49,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:49,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 10:53:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 10:53:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2079, Unknown=15, NotChecked=480, Total=2756 [2022-07-22 10:53:49,789 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 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-22 10:54:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:31,089 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-07-22 10:54:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-22 10:54:31,091 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 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 45 [2022-07-22 10:54:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:31,091 INFO L225 Difference]: With dead ends: 115 [2022-07-22 10:54:31,091 INFO L226 Difference]: Without dead ends: 111 [2022-07-22 10:54:31,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=385, Invalid=3644, Unknown=23, NotChecked=640, Total=4692 [2022-07-22 10:54:31,093 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 704 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:31,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 182 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 907 Invalid, 0 Unknown, 704 Unchecked, 0.8s Time] [2022-07-22 10:54:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-22 10:54:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2022-07-22 10:54:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 88 states have internal predecessors, (109), 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-22 10:54:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-07-22 10:54:31,108 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 45 [2022-07-22 10:54:31,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:31,108 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-07-22 10:54:31,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 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-22 10:54:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-07-22 10:54:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 10:54:31,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:31,109 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:31,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 10:54:31,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:31,334 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2022-07-22 10:54:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:31,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041999158] [2022-07-22 10:54:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:31,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:54:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465097780] [2022-07-22 10:54:31,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:54:31,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:31,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:31,354 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:31,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 10:54:31,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:54:31,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:54:31,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 10:54:31,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:31,637 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 31 treesize of output 15 [2022-07-22 10:54:31,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:31,701 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 16 treesize of output 18 [2022-07-22 10:54:31,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:31,740 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 16 treesize of output 18 [2022-07-22 10:54:31,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:31,783 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 16 treesize of output 18 [2022-07-22 10:54:31,819 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 19 treesize of output 7 [2022-07-22 10:54:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:54:31,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:31,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-22 10:54:31,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-22 10:54:31,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-22 10:54:31,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-22 10:54:31,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:54:31,951 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-07-22 10:54:31,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:54:31,959 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 38 [2022-07-22 10:54:31,962 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 11 treesize of output 7 [2022-07-22 10:54:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2022-07-22 10:54:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:32,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041999158] [2022-07-22 10:54:32,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:54:32,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465097780] [2022-07-22 10:54:32,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465097780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:32,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:54:32,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-22 10:54:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476538584] [2022-07-22 10:54:32,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:32,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 10:54:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 10:54:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-07-22 10:54:32,102 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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-22 10:54:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:32,807 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2022-07-22 10:54:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:54:32,807 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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 45 [2022-07-22 10:54:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:32,808 INFO L225 Difference]: With dead ends: 142 [2022-07-22 10:54:32,808 INFO L226 Difference]: Without dead ends: 135 [2022-07-22 10:54:32,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=495, Unknown=4, NotChecked=196, Total=812 [2022-07-22 10:54:32,809 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:32,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 93 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 561 Invalid, 0 Unknown, 349 Unchecked, 0.5s Time] [2022-07-22 10:54:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-22 10:54:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2022-07-22 10:54:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 117 states have internal predecessors, (145), 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-22 10:54:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2022-07-22 10:54:32,825 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 45 [2022-07-22 10:54:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:32,826 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2022-07-22 10:54:32,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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-22 10:54:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2022-07-22 10:54:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 10:54:32,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:32,831 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:32,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 10:54:33,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:33,041 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2022-07-22 10:54:33,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:33,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57408521] [2022-07-22 10:54:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:33,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:54:33,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166144063] [2022-07-22 10:54:33,052 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:54:33,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:33,054 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:33,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-22 10:54:33,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 10:54:33,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:54:33,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:54:33,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:33,211 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-22 10:54:33,320 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 37 treesize of output 17 [2022-07-22 10:54:33,376 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:54:33,376 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:54:33,422 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 16 treesize of output 18 [2022-07-22 10:54:33,452 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 16 treesize of output 18 [2022-07-22 10:54:33,486 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 19 treesize of output 7 [2022-07-22 10:54:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 10:54:33,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:33,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-22 10:54:33,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-22 10:54:33,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-22 10:54:33,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-22 10:54:33,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_287| Int)) (or (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= 3 (select (select (store (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_287| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_287|)))) is different from false [2022-07-22 10:54:35,506 INFO L356 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-07-22 10:54:35,507 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-07-22 10:54:35,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:54:35,515 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 38 [2022-07-22 10:54:35,519 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 11 treesize of output 7 [2022-07-22 10:54:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2022-07-22 10:54:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:35,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57408521] [2022-07-22 10:54:35,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:54:35,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166144063] [2022-07-22 10:54:35,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166144063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:35,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:54:35,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-22 10:54:35,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185898293] [2022-07-22 10:54:35,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:35,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 10:54:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:35,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 10:54:35,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2022-07-22 10:54:35,575 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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-22 10:54:37,705 WARN L833 $PredicateComparison]: unable to prove that (and (= 3 (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|))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_287| Int)) (or (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= 3 (select (select (store (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_287| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_287|)))) (= 2 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-22 10:54:39,741 WARN L833 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_287| Int)) (or (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= 3 (select (select (store (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_287| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_287|)))) (forall ((v_ArrVal_933 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-22 10:54:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:40,037 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2022-07-22 10:54:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 10:54:40,037 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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 45 [2022-07-22 10:54:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:40,038 INFO L225 Difference]: With dead ends: 196 [2022-07-22 10:54:40,038 INFO L226 Difference]: Without dead ends: 184 [2022-07-22 10:54:40,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2022-07-22 10:54:40,039 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:40,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 386 Invalid, 0 Unknown, 296 Unchecked, 0.3s Time] [2022-07-22 10:54:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-22 10:54:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2022-07-22 10:54:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 161 states have internal predecessors, (203), 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-22 10:54:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-07-22 10:54:40,063 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 45 [2022-07-22 10:54:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:40,063 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-07-22 10:54:40,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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-22 10:54:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-07-22 10:54:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 10:54:40,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:40,064 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:40,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-22 10:54:40,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:40,271 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2022-07-22 10:54:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636427489] [2022-07-22 10:54:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:40,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:54:40,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709880577] [2022-07-22 10:54:40,283 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:54:40,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:40,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:40,285 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:40,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-22 10:54:40,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 10:54:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:54:40,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:54:40,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:40,430 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-22 10:54:40,492 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 37 treesize of output 17 [2022-07-22 10:54:40,562 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:54:40,562 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:54:40,617 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:54:40,617 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:54:40,689 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 16 treesize of output 18 [2022-07-22 10:54:40,733 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 19 treesize of output 7 [2022-07-22 10:54:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 10:54:40,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:40,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-22 10:54:40,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-22 10:54:40,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-22 10:54:40,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_308| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= 3 (select (select (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_308|)))) is different from false [2022-07-22 10:54:40,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_1003 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_308|)))) is different from false [2022-07-22 10:54:40,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_309|)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_1003 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_309| 1) |v_ULTIMATE.start_main_~i~0#1_308|)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_309| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) is different from false [2022-07-22 10:54:40,996 INFO L356 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-07-22 10:54:40,996 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 55 [2022-07-22 10:54:41,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:54:41,007 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 38 [2022-07-22 10:54:41,012 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 11 treesize of output 7 [2022-07-22 10:54:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 22 not checked. [2022-07-22 10:54:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:41,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636427489] [2022-07-22 10:54:41,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:54:41,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709880577] [2022-07-22 10:54:41,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709880577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:41,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:54:41,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-22 10:54:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892680416] [2022-07-22 10:54:41,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:41,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 10:54:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 10:54:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=222, Unknown=6, NotChecked=210, Total=506 [2022-07-22 10:54:41,064 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 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-22 10:54:43,165 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_309|)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_1003 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_309| 1) |v_ULTIMATE.start_main_~i~0#1_308|)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_309| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (= 3 (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|))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-22 10:54:45,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_309|)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_1003 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_309| 1) |v_ULTIMATE.start_main_~i~0#1_308|)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_309| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_308| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= 3 (select (select (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_308|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-22 10:54:47,231 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_309| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_309|)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_1003 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_309| 1) |v_ULTIMATE.start_main_~i~0#1_308|)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (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_309| 4)) v_ArrVal_1000) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_308| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= 3 (select (select (store (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4)) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_308|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1004 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-07-22 10:54:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:47,417 INFO L93 Difference]: Finished difference Result 189 states and 232 transitions. [2022-07-22 10:54:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:54:47,418 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 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 45 [2022-07-22 10:54:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:47,419 INFO L225 Difference]: With dead ends: 189 [2022-07-22 10:54:47,419 INFO L226 Difference]: Without dead ends: 168 [2022-07-22 10:54:47,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=83, Invalid=250, Unknown=9, NotChecked=360, Total=702 [2022-07-22 10:54:47,420 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:47,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 263 Invalid, 0 Unknown, 258 Unchecked, 0.2s Time] [2022-07-22 10:54:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-22 10:54:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2022-07-22 10:54:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.2266666666666666) internal successors, (184), 150 states have internal predecessors, (184), 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-22 10:54:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 184 transitions. [2022-07-22 10:54:47,444 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 184 transitions. Word has length 45 [2022-07-22 10:54:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:47,445 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 184 transitions. [2022-07-22 10:54:47,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 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-22 10:54:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 184 transitions. [2022-07-22 10:54:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 10:54:47,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:47,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:47,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-22 10:54:47,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-22 10:54:47,646 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 2 times [2022-07-22 10:54:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:47,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816826533] [2022-07-22 10:54:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:47,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:54:47,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698057645] [2022-07-22 10:54:47,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:54:47,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:47,660 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:47,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-22 10:54:47,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:54:47,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:54:47,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-22 10:54:47,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:47,796 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 13 treesize of output 9 [2022-07-22 10:54:47,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:47,842 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 24 [2022-07-22 10:54:47,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:47,870 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 24 [2022-07-22 10:54:47,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:47,905 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 24 [2022-07-22 10:54:47,928 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 15 treesize of output 7 [2022-07-22 10:54:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:54:47,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:48,034 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 16 treesize of output 14 [2022-07-22 10:54:48,036 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 28 treesize of output 24 [2022-07-22 10:54:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:54:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816826533] [2022-07-22 10:54:48,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:54:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698057645] [2022-07-22 10:54:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698057645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:48,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:54:48,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-07-22 10:54:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38742618] [2022-07-22 10:54:48,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 10:54:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 10:54:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-22 10:54:48,103 INFO L87 Difference]: Start difference. First operand 151 states and 184 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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-22 10:54:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:48,584 INFO L93 Difference]: Finished difference Result 199 states and 239 transitions. [2022-07-22 10:54:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 10:54:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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 45 [2022-07-22 10:54:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:48,585 INFO L225 Difference]: With dead ends: 199 [2022-07-22 10:54:48,585 INFO L226 Difference]: Without dead ends: 144 [2022-07-22 10:54:48,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2022-07-22 10:54:48,586 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:48,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 86 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 10:54:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-22 10:54:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2022-07-22 10:54:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.1755725190839694) internal successors, (154), 131 states have internal predecessors, (154), 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-22 10:54:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2022-07-22 10:54:48,606 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 45 [2022-07-22 10:54:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:48,606 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2022-07-22 10:54:48,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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-22 10:54:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2022-07-22 10:54:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 10:54:48,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:48,607 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:48,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-22 10:54:48,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-22 10:54:48,825 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:48,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2022-07-22 10:54:48,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:48,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862783704] [2022-07-22 10:54:48,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:48,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:54:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:54:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:49,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862783704] [2022-07-22 10:54:49,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862783704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:54:49,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674895632] [2022-07-22 10:54:49,008 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:54:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:49,012 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:49,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-22 10:54:49,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 10:54:49,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:54:49,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 10:54:49,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:54:49,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:54:49,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674895632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:49,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:54:49,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 10:54:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342688875] [2022-07-22 10:54:49,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:49,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:54:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:54:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:54:49,434 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 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-22 10:54:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:50,062 INFO L93 Difference]: Finished difference Result 157 states and 183 transitions. [2022-07-22 10:54:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 10:54:50,063 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 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 47 [2022-07-22 10:54:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:50,064 INFO L225 Difference]: With dead ends: 157 [2022-07-22 10:54:50,064 INFO L226 Difference]: Without dead ends: 138 [2022-07-22 10:54:50,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-22 10:54:50,064 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:50,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 32 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 10:54:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-22 10:54:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2022-07-22 10:54:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 97 states have internal predecessors, (111), 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-22 10:54:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-22 10:54:50,081 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 47 [2022-07-22 10:54:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:50,081 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-22 10:54:50,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 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-22 10:54:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-22 10:54:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 10:54:50,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:50,082 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:50,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-22 10:54:50,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:50,292 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2022-07-22 10:54:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:50,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165214565] [2022-07-22 10:54:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:54:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:54:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:50,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165214565] [2022-07-22 10:54:50,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165214565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:54:50,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045274060] [2022-07-22 10:54:50,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:54:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:50,460 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:50,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-22 10:54:50,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 10:54:50,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:54:50,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 10:54:50,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:54:50,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:54:50,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045274060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:50,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:54:50,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 10:54:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395627133] [2022-07-22 10:54:50,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:50,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:54:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:54:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:54:50,964 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-22 10:54:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:54:51,354 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2022-07-22 10:54:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:54:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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 48 [2022-07-22 10:54:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:54:51,355 INFO L225 Difference]: With dead ends: 146 [2022-07-22 10:54:51,355 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 10:54:51,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:54:51,356 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:54:51,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 42 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 10:54:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 10:54:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-07-22 10:54:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:54:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-22 10:54:51,369 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 48 [2022-07-22 10:54:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:54:51,369 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-22 10:54:51,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-22 10:54:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-22 10:54:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 10:54:51,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:54:51,370 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:54:51,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-22 10:54:51,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:51,575 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:54:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:54:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2022-07-22 10:54:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:54:51,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570957187] [2022-07-22 10:54:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:54:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:54:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:54:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 10:54:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:52,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570957187] [2022-07-22 10:54:52,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570957187] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:54:52,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837462354] [2022-07-22 10:54:52,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:54:52,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:52,589 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:54:52,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-22 10:54:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:54:52,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-22 10:54:52,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:52,692 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-22 10:54:52,696 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-22 10:54:52,704 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 14 treesize of output 16 [2022-07-22 10:54:52,722 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 14 treesize of output 16 [2022-07-22 10:54:52,739 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 14 treesize of output 16 [2022-07-22 10:54:52,758 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 14 treesize of output 16 [2022-07-22 10:54:52,777 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 14 treesize of output 16 [2022-07-22 10:54:52,892 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 14 treesize of output 16 [2022-07-22 10:54:52,914 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 14 treesize of output 16 [2022-07-22 10:54:52,943 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 14 treesize of output 16 [2022-07-22 10:54:52,963 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 14 treesize of output 16 [2022-07-22 10:54:52,989 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 14 treesize of output 16 [2022-07-22 10:54:53,093 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-22 10:54:53,260 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:54:53,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-22 10:54:53,433 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:54:53,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-22 10:54:53,642 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:54:53,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-22 10:54:53,854 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-22 10:54:53,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2022-07-22 10:54:54,036 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-22 10:54:54,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 43 [2022-07-22 10:54:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 10:54:54,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:55:51,303 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_1293 (Array Int Int))) (or (forall ((v_subst_25 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 3)) (forall ((v_subst_23 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) 3)) (forall ((v_subst_22 Int)) (or (not (= 3 (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (+ .cse8 .cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) .cse10))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (forall ((v_subst_19 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (or (<= (* c_~N~0 3) (+ .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (not (= .cse11 3))))))))))))))))) (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_1293 (Array Int Int))) (or (forall ((v_subst_26 Int)) (or (forall ((v_subst_24 Int)) (or (not (= 3 (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .cse21 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) .cse22)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (forall ((v_subst_21 Int)) (or (not (= (select (select (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse26 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (+ .cse25 .cse26 .cse27 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)) (forall ((v_subst_20 Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse29 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse33 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (let ((.cse30 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse31 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse30 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (or (<= (+ .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (* c_~N~0 3)) (not (= 3 .cse31))))))))))))))) (not (= (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 3)))) (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) is different from false [2022-07-22 10:56:02,343 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_1293 (Array Int Int))) (or (forall ((v_subst_25 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 3)) (forall ((v_subst_23 Int)) (or (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) .cse4 .cse5)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) 3)) (forall ((v_subst_22 Int)) (or (forall ((v_subst_19 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse7 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (let ((.cse6 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (or (not (= .cse6 3)) (<= (* 3 ~N~0) (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))))))))))) (not (= 3 (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse16 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (+ .cse16 .cse17 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) .cse18))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))))))))) (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_1293 (Array Int Int))) (or (forall ((v_subst_26 Int)) (or (not (= (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) 3)) (forall ((v_subst_24 Int)) (or (not (= 3 (select (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (+ .cse23 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))) .cse24)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (forall ((v_subst_21 Int)) (or (not (= (select (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse28 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (+ .cse27 .cse28 .cse29 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)) (forall ((v_subst_20 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse31 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (let ((.cse32 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (or (<= (+ .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (* 3 ~N~0)) (not (= 3 .cse33))))))))))))))))) (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:56:02,567 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_27 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (forall ((v_subst_26 Int)) (or (forall ((v_subst_24 Int)) (or (forall ((v_subst_21 Int)) (or (forall ((v_subst_20 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (or (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 3 ~N~0)) (not (= 3 .cse3))))))))))) (not (= (select (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (+ .cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) .cse11 .cse12))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (+ .cse15 .cse16 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) 3)))) (not (= 3 (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_28 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (forall ((v_subst_25 Int)) (or (forall ((v_subst_23 Int)) (or (forall ((v_subst_22 Int)) (or (not (= (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (+ .cse21 .cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) .cse23))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 3)) (forall ((v_subst_19 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse26 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (let ((.cse28 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (let ((.cse24 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (or (not (= 3 .cse24)) (<= (* 3 ~N~0) (+ .cse25 .cse26 .cse27 .cse28 .cse29 .cse24))))))))))))) (not (= (select (select (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (+ .cse34 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) .cse35)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) 3)))) (not (= (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 3)))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))))) is different from false [2022-07-22 10:56:02,928 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_27 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (forall ((v_subst_26 Int)) (or (forall ((v_subst_24 Int)) (or (forall ((v_subst_21 Int)) (or (forall ((v_subst_20 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (or (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 3 ~N~0)) (not (= 3 .cse3))))))))))) (not (= (select (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (+ .cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) .cse11 .cse12))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (+ .cse15 .cse16 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) 3)))) (not (= 3 (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_28 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (forall ((v_subst_25 Int)) (or (forall ((v_subst_23 Int)) (or (forall ((v_subst_22 Int)) (or (not (= (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (+ .cse21 .cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) .cse23))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 3)) (forall ((v_subst_19 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse26 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (let ((.cse28 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (let ((.cse24 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (or (not (= 3 .cse24)) (<= (* 3 ~N~0) (+ .cse25 .cse26 .cse27 .cse28 .cse29 .cse24))))))))))))) (not (= (select (select (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (+ .cse34 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) .cse35)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) 3)))) (not (= (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 3)))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:56:03,289 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_27 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (forall ((v_subst_26 Int)) (or (forall ((v_subst_24 Int)) (or (forall ((v_subst_21 Int)) (or (forall ((v_subst_20 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (or (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 3 ~N~0)) (not (= 3 .cse3))))))))))) (not (= (select (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (+ .cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) .cse11 .cse12))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (+ .cse15 .cse16 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) 3)))) (not (= 3 (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_28 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (forall ((v_subst_25 Int)) (or (forall ((v_subst_23 Int)) (or (forall ((v_subst_22 Int)) (or (not (= (select (select (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (+ .cse21 .cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) .cse23))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 3)) (forall ((v_subst_19 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse26 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (let ((.cse28 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (let ((.cse24 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (or (not (= 3 .cse24)) (<= (* 3 ~N~0) (+ .cse25 .cse26 .cse27 .cse28 .cse29 .cse24))))))))))))) (not (= (select (select (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (+ .cse34 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) .cse35)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) 3)))) (not (= (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 3)))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:56:03,667 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_28 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (forall ((v_subst_25 Int)) (or (forall ((v_subst_23 Int)) (or (forall ((v_subst_22 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (+ .cse2 .cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) .cse4))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))) 3)) (forall ((v_subst_19 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (let ((.cse7 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_22 4))))) (let ((.cse5 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_19 4))))) (or (not (= 3 .cse5)) (<= (* 3 ~N~0) (+ .cse6 .cse7 .cse8 .cse9 .cse10 .cse5))))))))))))) (not (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4))))) (+ .cse15 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) .cse16)))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_23 4))) 3)))) (not (= (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_28 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_25 4))) 3)))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))) (forall ((~N~0 Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_27 Int) (v_ArrVal_1293 (Array Int Int))) (or (not (= 3 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (forall ((v_subst_26 Int)) (or (forall ((v_subst_24 Int)) (or (forall ((v_subst_21 Int)) (or (forall ((v_subst_20 Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (let ((.cse21 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))))) (let ((.cse20 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_20 4))))) (or (<= (+ .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (* 3 ~N~0)) (not (= 3 .cse22))))))))))) (not (= (select (select (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse30 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (let ((.cse31 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))) (+ .cse29 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) .cse30 .cse31))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_21 4) |ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= (select (select (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4))))) (+ .cse34 .cse35 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_24 4))) 3)))) (not (= 3 (select (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_27 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_26 4))))))))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-22 10:56:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 26 trivial. 34 not checked. [2022-07-22 10:56:03,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837462354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:03,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:03,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 22] total 56 [2022-07-22 10:56:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709165569] [2022-07-22 10:56:03,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:03,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-22 10:56:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-22 10:56:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2260, Unknown=29, NotChecked=606, Total=3080 [2022-07-22 10:56:03,947 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 56 states have internal predecessors, (99), 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)