./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina4.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 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:44:10,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:44:10,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:44:10,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:44:10,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:44:10,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:44:10,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:44:10,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:44:10,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:44:10,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:44:10,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:44:10,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:44:10,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:44:10,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:44:10,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:44:10,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:44:10,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:44:10,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:44:10,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:44:10,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:44:10,578 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:44:10,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:44:10,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:44:10,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:44:10,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:44:10,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:44:10,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:44:10,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:44:10,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:44:10,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:44:10,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:44:10,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:44:10,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:44:10,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:44:10,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:44:10,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:44:10,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:44:10,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:44:10,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:44:10,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:44:10,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:44:10,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:44:10,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:44:10,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:44:10,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:44:10,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:44:10,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:44:10,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:44:10,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:44:10,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:44:10,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:44:10,639 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:44:10,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:44:10,640 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:44:10,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:44:10,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:44:10,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:44:10,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:44:10,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:44:10,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:44:10,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:44:10,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:44:10,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:44:10,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:44:10,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:44:10,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:44:10,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:44:10,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:44:10,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:44:10,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:44:10,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:44:10,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:44:10,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:44:10,650 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:44:10,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:44:10,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:44:10,650 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 -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2022-07-19 10:44:10,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:44:10,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:44:10,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:44:10,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:44:10,972 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:44:10,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2022-07-19 10:44:11,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d780585c/c1dd8da5680541cb840336418846f6e4/FLAG55103dd4b [2022-07-19 10:44:11,426 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:44:11,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2022-07-19 10:44:11,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d780585c/c1dd8da5680541cb840336418846f6e4/FLAG55103dd4b [2022-07-19 10:44:11,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d780585c/c1dd8da5680541cb840336418846f6e4 [2022-07-19 10:44:11,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:44:11,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:44:11,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:44:11,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:44:11,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:44:11,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8c177f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11, skipping insertion in model container [2022-07-19 10:44:11,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:44:11,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:44:11,644 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/sina4.c[588,601] [2022-07-19 10:44:11,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:44:11,685 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:44:11,695 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/sina4.c[588,601] [2022-07-19 10:44:11,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:44:11,717 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:44:11,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11 WrapperNode [2022-07-19 10:44:11,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:44:11,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:44:11,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:44:11,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:44:11,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,761 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-07-19 10:44:11,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:44:11,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:44:11,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:44:11,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:44:11,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:44:11,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:44:11,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:44:11,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:44:11,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (1/1) ... [2022-07-19 10:44:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:44:11,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:11,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:44:11,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:44:11,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:44:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:44:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:44:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:44:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:44:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:44:11,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:44:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:44:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:44:11,968 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:44:11,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:44:12,199 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:44:12,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:44:12,209 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 10:44:12,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:44:12 BoogieIcfgContainer [2022-07-19 10:44:12,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:44:12,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:44:12,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:44:12,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:44:12,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:44:11" (1/3) ... [2022-07-19 10:44:12,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3707a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:44:12, skipping insertion in model container [2022-07-19 10:44:12,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:44:11" (2/3) ... [2022-07-19 10:44:12,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3707a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:44:12, skipping insertion in model container [2022-07-19 10:44:12,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:44:12" (3/3) ... [2022-07-19 10:44:12,220 INFO L111 eAbstractionObserver]: Analyzing ICFG sina4.c [2022-07-19 10:44:12,235 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:44:12,236 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:44:12,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:44:12,297 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@5abcc088, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@145c5203 [2022-07-19 10:44:12,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:44:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:44:12,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:12,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:12,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-07-19 10:44:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:12,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791576996] [2022-07-19 10:44:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:12,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791576996] [2022-07-19 10:44:12,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791576996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:44:12,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:44:12,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:44:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942783323] [2022-07-19 10:44:12,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:44:12,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:44:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:44:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:44:12,515 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:12,531 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-19 10:44:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:44:12,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:44:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:12,542 INFO L225 Difference]: With dead ends: 50 [2022-07-19 10:44:12,542 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 10:44:12,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:44:12,549 INFO L413 NwaCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:12,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:44:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 10:44:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 10:44:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-19 10:44:12,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-19 10:44:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:12,581 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-19 10:44:12,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-19 10:44:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:44:12,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:12,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:12,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:44:12,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-07-19 10:44:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:12,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018904015] [2022-07-19 10:44:12,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:12,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018904015] [2022-07-19 10:44:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018904015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:44:12,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:44:12,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:44:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61299950] [2022-07-19 10:44:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:44:12,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:44:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:44:12,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:44:12,739 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:12,822 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-07-19 10:44:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:44:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:44:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:12,824 INFO L225 Difference]: With dead ends: 53 [2022-07-19 10:44:12,824 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 10:44:12,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:44:12,829 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:12,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:44:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 10:44:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-07-19 10:44:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-19 10:44:12,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-07-19 10:44:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:12,845 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-19 10:44:12,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-19 10:44:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:44:12,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:12,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:12,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:44:12,849 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-07-19 10:44:12,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:12,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800436124] [2022-07-19 10:44:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:13,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800436124] [2022-07-19 10:44:13,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800436124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:13,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088889665] [2022-07-19 10:44:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:13,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:13,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:13,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:13,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:44:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:13,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-19 10:44:13,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:13,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:44:13,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:44:13,733 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 23 treesize of output 22 [2022-07-19 10:44:13,837 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-19 10:44:13,963 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 36 treesize of output 23 [2022-07-19 10:44:14,153 INFO L356 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2022-07-19 10:44:14,154 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 2 case distinctions, treesize of input 40 treesize of output 46 [2022-07-19 10:44:16,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:44:16,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 72 [2022-07-19 10:44:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:16,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:18,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int)) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2022-07-19 10:44:19,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 10:44:19,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088889665] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:19,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:19,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-07-19 10:44:19,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710401815] [2022-07-19 10:44:19,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 10:44:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 10:44:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=916, Unknown=1, NotChecked=62, Total=1122 [2022-07-19 10:44:19,297 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:24,883 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 43 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:44:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:24,940 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-19 10:44:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 10:44:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:44:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:24,943 INFO L225 Difference]: With dead ends: 53 [2022-07-19 10:44:24,943 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 10:44:24,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=178, Invalid=1085, Unknown=1, NotChecked=68, Total=1332 [2022-07-19 10:44:24,944 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:24,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 130 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 276 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-19 10:44:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 10:44:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-07-19 10:44:24,952 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-19 10:44:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-19 10:44:24,953 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-07-19 10:44:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:24,953 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-19 10:44:24,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-19 10:44:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:44:24,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:24,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:24,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:25,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:25,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:25,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-07-19 10:44:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:25,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173774814] [2022-07-19 10:44:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:25,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173774814] [2022-07-19 10:44:25,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173774814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:25,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884871036] [2022-07-19 10:44:25,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:44:25,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:25,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:25,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:44:25,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:44:25,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:25,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:44:25,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:25,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:25,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884871036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:25,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:25,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:44:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695396193] [2022-07-19 10:44:25,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:25,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:44:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:44:25,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:44:25,371 INFO L87 Difference]: Start difference. First operand 44 states and 52 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-19 10:44:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:25,538 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-07-19 10:44:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:44:25,539 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 26 [2022-07-19 10:44:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:25,540 INFO L225 Difference]: With dead ends: 101 [2022-07-19 10:44:25,540 INFO L226 Difference]: Without dead ends: 66 [2022-07-19 10:44:25,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 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-19 10:44:25,541 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:25,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:44:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-19 10:44:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-07-19 10:44:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-19 10:44:25,549 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-07-19 10:44:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:25,549 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-19 10:44:25,549 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-19 10:44:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-19 10:44:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:44:25,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:25,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:25,573 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-19 10:44:25,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:44:25,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-07-19 10:44:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:25,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926313284] [2022-07-19 10:44:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:25,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926313284] [2022-07-19 10:44:25,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926313284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:25,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924907467] [2022-07-19 10:44:25,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:44:25,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:25,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:25,823 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:25,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:44:25,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:44:25,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:25,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:44:25,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:25,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:25,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924907467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:25,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:25,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:44:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666885989] [2022-07-19 10:44:25,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:25,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:44:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:44:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:44:25,993 INFO L87 Difference]: Start difference. First operand 46 states and 53 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-19 10:44:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:26,126 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-19 10:44:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:44:26,127 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 26 [2022-07-19 10:44:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:26,127 INFO L225 Difference]: With dead ends: 63 [2022-07-19 10:44:26,127 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 10:44:26,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 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-19 10:44:26,128 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 91 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:26,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 42 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:44:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 10:44:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-19 10:44:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-19 10:44:26,134 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-07-19 10:44:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:26,134 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-19 10:44:26,134 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-19 10:44:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-19 10:44:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:44:26,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:26,135 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, 1, 1, 1] [2022-07-19 10:44:26,161 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-19 10:44:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:26,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-07-19 10:44:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352417331] [2022-07-19 10:44:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:27,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352417331] [2022-07-19 10:44:27,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352417331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:27,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913514256] [2022-07-19 10:44:27,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:44:27,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:27,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:27,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:27,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:44:27,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:44:27,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:27,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 10:44:27,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:27,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:44:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:27,661 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 23 treesize of output 22 [2022-07-19 10:44:27,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:27,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:27,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:44:28,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:28,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-19 10:44:28,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2022-07-19 10:44:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2022-07-19 10:44:28,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,510 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-19 10:44:28,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2022-07-19 10:44:28,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:28,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:28,699 INFO L356 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-07-19 10:44:28,699 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2022-07-19 10:44:28,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:28,999 INFO L356 Elim1Store]: treesize reduction 96, result has 34.7 percent of original size [2022-07-19 10:44:28,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 8 case distinctions, treesize of input 64 treesize of output 108 [2022-07-19 10:44:29,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:44:29,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 121 [2022-07-19 10:44:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:29,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:31,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-19 10:44:33,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-19 10:44:35,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (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_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-07-19 10:44:36,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-07-19 10:44:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-19 10:44:38,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913514256] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:38,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:38,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 64 [2022-07-19 10:44:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183990687] [2022-07-19 10:44:38,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:38,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-19 10:44:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-19 10:44:38,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3250, Unknown=4, NotChecked=476, Total=4032 [2022-07-19 10:44:38,277 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:40,576 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse1 (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_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) (or (< 2 c_~N~0) (let ((.cse3 (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (+ c_~N~0 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (+ (* .cse4 2) (* (- 1) (select .cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* (- 1) .cse6)) 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (* (- 1) .cse4) .cse6) 1))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-19 10:44:42,699 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (+ c_~N~0 2))) (and (<= c_~N~0 2) (or (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* 8 |c_ULTIMATE.start_main_~i~0#1|)) 3) (or (< (+ |ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~b~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (< (+ |ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse0 .cse1) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 4) (<= .cse1 .cse0))) is different from false [2022-07-19 10:44:44,873 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (+ c_~N~0 2))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse0 .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0))) is different from false [2022-07-19 10:44:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:44,901 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-19 10:44:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-19 10:44:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-19 10:44:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:44,904 INFO L225 Difference]: With dead ends: 81 [2022-07-19 10:44:44,904 INFO L226 Difference]: Without dead ends: 79 [2022-07-19 10:44:44,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=357, Invalid=3824, Unknown=7, NotChecked=924, Total=5112 [2022-07-19 10:44:44,907 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:44,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 182 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 252 Invalid, 0 Unknown, 510 Unchecked, 0.2s Time] [2022-07-19 10:44:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-19 10:44:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2022-07-19 10:44:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-19 10:44:44,916 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 32 [2022-07-19 10:44:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:44,916 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-19 10:44:44,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-19 10:44:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:44:44,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:44,918 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, 1, 1, 1] [2022-07-19 10:44:44,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:45,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:45,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:45,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2022-07-19 10:44:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:45,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146682031] [2022-07-19 10:44:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 10:44:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146682031] [2022-07-19 10:44:45,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146682031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:45,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247401267] [2022-07-19 10:44:45,205 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:44:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:45,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:45,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:44:45,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 10:44:45,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:45,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:44:45,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 10:44:45,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 10:44:45,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247401267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:45,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:45,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:44:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760393877] [2022-07-19 10:44:45,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:44:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:44:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:44:45,439 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:45,615 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-19 10:44:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:44:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:44:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:45,616 INFO L225 Difference]: With dead ends: 129 [2022-07-19 10:44:45,616 INFO L226 Difference]: Without dead ends: 105 [2022-07-19 10:44:45,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 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-19 10:44:45,617 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 130 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:45,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 64 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:44:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-19 10:44:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-07-19 10:44:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-19 10:44:45,639 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2022-07-19 10:44:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:45,639 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-19 10:44:45,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-19 10:44:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:44:45,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:45,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:45,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:45,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:45,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-07-19 10:44:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:45,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524921761] [2022-07-19 10:44:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:47,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524921761] [2022-07-19 10:44:47,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524921761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:47,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130585968] [2022-07-19 10:44:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:47,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:47,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:44:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:47,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-19 10:44:47,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:47,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:44:47,365 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:44:47,365 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 54 treesize of output 50 [2022-07-19 10:44:47,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:44:47,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:47,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:44:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:47,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:47,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:47,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-19 10:44:47,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:47,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:47,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:47,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-19 10:44:47,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:47,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2022-07-19 10:44:48,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:48,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:48,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 47 [2022-07-19 10:44:48,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:48,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:48,325 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-19 10:44:48,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 75 [2022-07-19 10:44:48,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:48,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:44:48,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:44:48,503 INFO L356 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2022-07-19 10:44:48,504 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 8 case distinctions, treesize of input 45 treesize of output 45 [2022-07-19 10:44:48,879 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-19 10:44:48,880 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 6 case distinctions, treesize of input 67 treesize of output 35 [2022-07-19 10:44:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:48,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:44:52,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130585968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:52,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:52,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 23] total 66 [2022-07-19 10:44:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992619392] [2022-07-19 10:44:52,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:52,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-19 10:44:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-19 10:44:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2022-07-19 10:44:52,558 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:58,303 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-19 10:44:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-19 10:44:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-19 10:44:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:58,305 INFO L225 Difference]: With dead ends: 126 [2022-07-19 10:44:58,305 INFO L226 Difference]: Without dead ends: 81 [2022-07-19 10:44:58,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=707, Invalid=7849, Unknown=0, NotChecked=0, Total=8556 [2022-07-19 10:44:58,307 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:58,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 236 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 0 Unknown, 149 Unchecked, 0.5s Time] [2022-07-19 10:44:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-19 10:44:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-19 10:44:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-07-19 10:44:58,327 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 36 [2022-07-19 10:44:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:58,331 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-07-19 10:44:58,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-07-19 10:44:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:44:58,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:58,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:58,351 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-19 10:44:58,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:58,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:58,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2022-07-19 10:44:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:58,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983294661] [2022-07-19 10:44:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:44:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:58,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983294661] [2022-07-19 10:44:58,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983294661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:58,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165773182] [2022-07-19 10:44:58,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:44:58,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:58,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:58,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:44:58,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:44:58,690 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-19 10:44:58,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:58,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:44:58,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:44:58,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:44:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:44:58,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165773182] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:44:58,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:44:58,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:44:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709463397] [2022-07-19 10:44:58,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:44:58,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:44:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:44:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:44:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:44:58,799 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:58,965 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-07-19 10:44:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:44:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-19 10:44:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:58,966 INFO L225 Difference]: With dead ends: 104 [2022-07-19 10:44:58,966 INFO L226 Difference]: Without dead ends: 74 [2022-07-19 10:44:58,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 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-19 10:44:58,967 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 101 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:58,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 71 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:44:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-19 10:44:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 43. [2022-07-19 10:44:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-19 10:44:58,974 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2022-07-19 10:44:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:58,974 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-19 10:44:58,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:44:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-19 10:44:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:44:58,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:58,975 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, 1, 1, 1] [2022-07-19 10:44:58,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:59,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:59,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-07-19 10:44:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863984548] [2022-07-19 10:44:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:00,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863984548] [2022-07-19 10:45:00,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863984548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:00,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967884569] [2022-07-19 10:45:00,432 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:45:00,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:00,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:00,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:00,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:45:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:00,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 10:45:00,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:00,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:45:00,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 10 treesize of output 8 [2022-07-19 10:45:00,529 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 23 treesize of output 22 [2022-07-19 10:45:00,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:45:00,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-19 10:45:00,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-19 10:45:00,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:00,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:00,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2022-07-19 10:45:01,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2022-07-19 10:45:01,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:01,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2022-07-19 10:45:01,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:01,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2022-07-19 10:45:01,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:01,528 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-19 10:45:01,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 54 [2022-07-19 10:45:01,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:01,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:01,710 INFO L356 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-07-19 10:45:01,711 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56 [2022-07-19 10:45:04,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:04,366 INFO L356 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2022-07-19 10:45:04,366 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 4 case distinctions, treesize of input 57 treesize of output 66 [2022-07-19 10:45:05,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:05,830 INFO L356 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2022-07-19 10:45:05,830 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 4 case distinctions, treesize of input 57 treesize of output 66 [2022-07-19 10:45:07,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:45:07,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 74 [2022-07-19 10:45:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:07,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:09,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((v_ArrVal_519 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2022-07-19 10:45:09,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)))) is different from false [2022-07-19 10:45:11,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-07-19 10:45:13,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))) is different from false [2022-07-19 10:45:16,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) is different from false [2022-07-19 10:46:59,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,932 INFO L356 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2022-07-19 10:46:59,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 1 [2022-07-19 10:46:59,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:46:59,946 INFO L356 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2022-07-19 10:46:59,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 1 [2022-07-19 10:46:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-19 10:46:59,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967884569] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:46:59,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:46:59,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 30] total 73 [2022-07-19 10:46:59,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777755766] [2022-07-19 10:46:59,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:46:59,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-19 10:46:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:46:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-19 10:46:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=4213, Unknown=49, NotChecked=680, Total=5256 [2022-07-19 10:46:59,952 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 73 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:02,414 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (+ c_~N~0 1)) (.cse2 (select .cse4 0))) (and (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (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_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (+ .cse1 (- 3)) 0) (= (+ .cse1 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse2 .cse3) (<= 3 c_~N~0) (= (select .cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse3 .cse2) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-19 10:47:04,487 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (= (+ (- 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (forall ((v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_510) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_153|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2022-07-19 10:47:10,816 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (forall ((v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_510) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_153|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|))))) is different from false [2022-07-19 10:47:15,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse2 (+ c_~N~0 2))) (and (= (+ (- 5) .cse0) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|)))) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse1) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (<= .cse2 .cse0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse0 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) is different from false [2022-07-19 10:47:22,449 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 64 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:47:24,452 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse1 (+ c_~N~0 2)) (.cse0 (select .cse2 0))) (and (or (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|))))) (<= .cse0 .cse1) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (<= (+ 1 (div (* (- 1) |c_ULTIMATE.start_main_~b~0#1.offset|) 8)) |c_ULTIMATE.start_main_~i~0#1|) (= (+ (- 5) (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((v_ArrVal_519 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) is different from false [2022-07-19 10:47:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:47:34,691 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-07-19 10:47:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-19 10:47:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 10:47:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:47:34,693 INFO L225 Difference]: With dead ends: 90 [2022-07-19 10:47:34,693 INFO L226 Difference]: Without dead ends: 88 [2022-07-19 10:47:34,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 152.3s TimeCoverageRelationStatistics Valid=432, Invalid=5555, Unknown=59, NotChecked=1610, Total=7656 [2022-07-19 10:47:34,695 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 703 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:47:34,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 181 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 703 Unchecked, 0.2s Time] [2022-07-19 10:47:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-19 10:47:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-07-19 10:47:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2022-07-19 10:47:34,711 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 40 [2022-07-19 10:47:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:47:34,711 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2022-07-19 10:47:34,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2022-07-19 10:47:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 10:47:34,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:47:34,713 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, 1, 1, 1] [2022-07-19 10:47:34,740 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-19 10:47:34,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 10:47:34,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:47:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:47:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1012369648, now seen corresponding path program 8 times [2022-07-19 10:47:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:47:34,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765669226] [2022-07-19 10:47:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:47:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:47:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:47:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:47:34,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:47:34,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765669226] [2022-07-19 10:47:34,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765669226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:47:34,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093822888] [2022-07-19 10:47:34,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:47:34,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:47:34,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:47:34,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:47:35,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:47:35,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:47:35,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:47:35,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:47:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:47:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:47:35,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:47:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:47:35,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093822888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:47:35,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:47:35,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:47:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318162822] [2022-07-19 10:47:35,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:47:35,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:47:35,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:47:35,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:47:35,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:47:35,227 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:47:35,446 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2022-07-19 10:47:35,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:47:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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) Word has length 42 [2022-07-19 10:47:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:47:35,447 INFO L225 Difference]: With dead ends: 184 [2022-07-19 10:47:35,447 INFO L226 Difference]: Without dead ends: 141 [2022-07-19 10:47:35,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 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-19 10:47:35,448 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 245 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:47:35,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 79 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:47:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-19 10:47:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-07-19 10:47:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-07-19 10:47:35,457 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2022-07-19 10:47:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:47:35,457 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-07-19 10:47:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-07-19 10:47:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 10:47:35,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:47:35,458 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, 1, 1, 1] [2022-07-19 10:47:35,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:47:35,671 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-19 10:47:35,672 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:47:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:47:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash -308361392, now seen corresponding path program 9 times [2022-07-19 10:47:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:47:35,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279451761] [2022-07-19 10:47:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:47:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:47:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:47:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:47:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:47:35,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279451761] [2022-07-19 10:47:35,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279451761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:47:35,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62636111] [2022-07-19 10:47:35,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:47:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:47:35,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:47:35,764 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-19 10:47:35,771 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-19 10:47:35,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 10:47:35,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:47:35,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:47:35,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:47:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:47:36,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:47:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:47:36,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62636111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:47:36,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:47:36,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:47:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308600930] [2022-07-19 10:47:36,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:47:36,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:47:36,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:47:36,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:47:36,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:47:36,039 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:47:36,349 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-19 10:47:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:47:36,349 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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) Word has length 42 [2022-07-19 10:47:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:47:36,350 INFO L225 Difference]: With dead ends: 146 [2022-07-19 10:47:36,350 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 10:47:36,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 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-19 10:47:36,351 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 145 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:47:36,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 174 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:47:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 10:47:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2022-07-19 10:47:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-19 10:47:36,365 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 42 [2022-07-19 10:47:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:47:36,366 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-19 10:47:36,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:47:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-19 10:47:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:47:36,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:47:36,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:47:36,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:47:36,599 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-19 10:47:36,599 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:47:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:47:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2022-07-19 10:47:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:47:36,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446848157] [2022-07-19 10:47:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:47:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:47:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:47:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:47:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:47:38,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446848157] [2022-07-19 10:47:38,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446848157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:47:38,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539936124] [2022-07-19 10:47:38,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:47:38,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:47:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:47:38,356 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-19 10:47:38,357 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-19 10:47:38,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:47:38,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:47:38,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-19 10:47:38,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:47:38,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:47:38,461 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:47:38,461 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 108 treesize of output 102 [2022-07-19 10:47:38,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:47:38,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-19 10:47:38,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-19 10:47:38,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:38,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-19 10:47:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:39,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2022-07-19 10:47:39,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2022-07-19 10:47:39,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:39,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2022-07-19 10:47:39,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:39,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2022-07-19 10:47:39,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:47:39,650 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-19 10:47:39,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 56 [2022-07-19 10:47:39,845 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 10:47:39,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 10:47:39,859 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 21 treesize of output 17 [2022-07-19 10:47:39,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:39,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 10:47:40,117 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:47:40,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-07-19 10:47:40,336 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 59 treesize of output 31 [2022-07-19 10:47:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:47:40,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:47:42,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_225|)) (forall ((v_ArrVal_766 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_225|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_766) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-07-19 10:47:56,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| .cse0 8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_225|)) (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store v_ArrVal_762 (+ |ULTIMATE.start_main_~b~0#1.offset| .cse0 8) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))))) is different from false [2022-07-19 10:47:56,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)) (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (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|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))))) is different from false [2022-07-19 10:47:56,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (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|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-07-19 10:47:56,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-07-19 10:47:56,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (store .cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_757))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-07-19 10:47:56,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)) (+ c_~N~0 2)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6 .cse7)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)) (+ c_~N~0 2)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:56,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:57,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (let ((.cse2 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse2 (+ (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse3 (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (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|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse10 .cse11)))))))))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse4 .cse5 (+ (select .cse6 .cse5) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse2)))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:57,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse7 .cse8 .cse9)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse11 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse11 (+ (let ((.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse12 (let ((.cse21 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18 .cse19 .cse20)))))))))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse15 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse13 .cse14 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse15 .cse14))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse11)) (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:57,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (let ((.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse7 .cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse9)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)) (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (let ((.cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse12 (+ (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse13 (let ((.cse22 (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (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| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (+ .cse19 .cse20 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse21)))))))))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse16 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse14 .cse15 (+ (select .cse16 .cse15) (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse12))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:57,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ 5 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (let ((.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8 .cse9)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse12 (+ (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse13 (let ((.cse22 (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse23 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (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| (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (+ .cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse20 .cse21)))))))))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse16 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse14 .cse15 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse15))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse12)) (+ 5 |c_ULTIMATE.start_main_~i~0#1|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:58,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ 5 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (let ((.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse7 .cse8 .cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse12 (+ (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse13 (let ((.cse22 (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (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| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (+ .cse19 .cse20 .cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse16 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse14 .cse15 (+ (select .cse16 .cse15) (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse12)) (+ 5 |c_ULTIMATE.start_main_~i~0#1|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-19 10:47:58,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,126 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-19 10:47:58,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 1 [2022-07-19 10:47:58,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:47:58,140 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-19 10:47:58,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 1 [2022-07-19 10:47:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-07-19 10:47:58,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539936124] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:47:58,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:47:58,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 31] total 89 [2022-07-19 10:47:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441219020] [2022-07-19 10:47:58,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:47:58,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-19 10:47:58,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:47:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-19 10:47:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4205, Unknown=33, NotChecked=3192, Total=7832 [2022-07-19 10:47:58,146 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 89 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:05,886 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 96 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:48:07,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select .cse1 .cse3)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (and (< 2 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (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|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (<= 3 c_~N~0) (= (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (+ .cse2 (- 3)) 1) (or (not (= .cse3 8)) (let ((.cse4 (+ c_~N~0 1))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= .cse4 .cse2) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5 (<= .cse2 .cse4)))) (<= c_~N~0 3) .cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-19 10:48:11,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (+ c_~N~0 1)) (.cse4 (+ c_~N~0 2)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse3))) (and (< 2 c_~N~0) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= .cse1 .cse2) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= .cse3 8) (<= .cse4 .cse5) (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_225|)) (forall ((v_ArrVal_766 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_225|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_766) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (<= c_~N~0 3) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse6 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))) (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse2 .cse1) (<= .cse5 .cse4) (= (+ (- 1) .cse5) 4) (= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-07-19 10:48:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:11,698 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-07-19 10:48:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 10:48:11,698 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 0 states have call successors, (0), 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 44 [2022-07-19 10:48:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:11,699 INFO L225 Difference]: With dead ends: 89 [2022-07-19 10:48:11,699 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 10:48:11,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 115 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2836 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=697, Invalid=8102, Unknown=35, NotChecked=4738, Total=13572 [2022-07-19 10:48:11,702 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 901 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:11,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 271 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 415 Invalid, 0 Unknown, 901 Unchecked, 0.3s Time] [2022-07-19 10:48:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 10:48:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-07-19 10:48:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-19 10:48:11,713 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 44 [2022-07-19 10:48:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:11,713 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-19 10:48:11,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-19 10:48:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:48:11,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:11,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:11,733 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-19 10:48:11,920 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-19 10:48:11,921 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 3 times [2022-07-19 10:48:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:11,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134959917] [2022-07-19 10:48:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134959917] [2022-07-19 10:48:13,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134959917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:48:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621642216] [2022-07-19 10:48:13,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:48:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:13,242 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-19 10:48:13,242 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-19 10:48:13,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:48:13,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:48:13,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-19 10:48:13,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:13,372 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 98 treesize of output 94 [2022-07-19 10:48:13,425 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 15 treesize of output 11 [2022-07-19 10:48:13,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:13,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:48:13,554 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 10:48:13,554 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 23 treesize of output 22 [2022-07-19 10:48:13,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:13,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-19 10:48:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:13,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-19 10:48:13,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:13,998 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:48:13,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:48:14,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:14,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:48:14,216 INFO L356 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2022-07-19 10:48:14,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 46 [2022-07-19 10:48:14,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:14,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:14,380 INFO L356 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2022-07-19 10:48:14,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 68 [2022-07-19 10:48:14,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:14,527 INFO L356 Elim1Store]: treesize reduction 68, result has 44.7 percent of original size [2022-07-19 10:48:14,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 107 [2022-07-19 10:48:23,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:23,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:48:23,532 INFO L356 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2022-07-19 10:48:23,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 138 [2022-07-19 10:48:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:48:24,430 INFO L356 Elim1Store]: treesize reduction 200, result has 23.7 percent of original size [2022-07-19 10:48:24,431 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 13 case distinctions, treesize of input 160 treesize of output 179 [2022-07-19 10:48:25,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:48:25,771 INFO L356 Elim1Store]: treesize reduction 428, result has 21.3 percent of original size [2022-07-19 10:48:25,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 200 treesize of output 247